LEADER 04375oam 2200589 450 001 996466137903316 005 20210714195452.0 010 $a3-540-69346-7 024 7 $a10.1007/3-540-69346-7 035 $a(CKB)1000000000210930 035 $a(SSID)ssj0000324038 035 $a(PQKBManifestationID)11241172 035 $a(PQKBTitleCode)TC0000324038 035 $a(PQKBWorkID)10303636 035 $a(PQKB)10341211 035 $a(DE-He213)978-3-540-69346-8 035 $a(MiAaPQ)EBC3072038 035 $a(MiAaPQ)EBC6485796 035 $a(PPN)15523434X 035 $a(EXLCZ)991000000000210930 100 $a20210714d1998 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aInteger programming and combinatorial optimization $e6th International IPCO Conference, Houston, Texas, June 22-24, 1998 : proceedings /$fRobert E. Bixby, E. Andrew Boyd, Roger Z. Ríos-Mercado (editors) 205 $a1st ed. 1998. 210 1$aBerlin, Germany :$cSpringer,$d[1998] 210 4$d©1998 215 $a1 online resource (IX, 435 p. 55 illus., 18 illus. in color.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1412 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-64590-X 320 $aIncludes bibliographical references and index. 327 $a0,1 Matrices, Matroids -- The Packing Property -- A Characterization of Weakly Bipartite Graphs -- Bipartite Designs -- Characterizing Noninteger Polyhedra with 0?1 Constraints -- A Theorem of Truemper -- The Generalized Stable Set Problem for Claw-Free Bidirected Graphs -- On a Min-max Theorem of Cacti -- Edge Connectivity -- Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs -- A New Bound for the 2-Edge Connected Subgraph Problem -- An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs -- Algorithms -- Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width -- Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs -- Approximation Algorithms for the Mixed Postman Problem -- Improved Approximation Algorithms for Uncapacitated Facility Location -- The Maximum Traveling Salesman Problem Under Polyhedral Norms -- Integer Programming Applications -- Polyhedral Combinatorics of Benzenoid Problems -- Consecutive Ones and a Betweenness Problem in Computational Biology -- Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables -- Integer Programming Computation -- The Intersection of Knapsack Polyhedra and Extensions -- New Classes of Lower Bounds for Bin Packing Problems -- Solving Integer and Disjunctive Programs by Lift and Project -- A Class of Hard Small 0?1 Programs -- Network Flows -- Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time -- Simple Generalized Maximum Flow Algorithms -- The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem -- An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow -- Scheduling -- Non-approximability Results for Scheduling Problems with Minsum Criteria -- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems -- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines -- On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems -- Quadratic Assignment Problems -- Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations -- Incorporating Inequality Constraints in the Spectral Bundle Method. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1412 606 $aCombinatorial optimization$vCongresses 606 $aInteger programming$vCongresses 615 0$aCombinatorial optimization 615 0$aInteger programming 676 $a519.77 702 $aRíos-Mercado$b Roger Z. 702 $aBixby$b Robert$f1952-2012, 702 $aBoyd$b E. Andrew 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996466137903316 996 $aInteger Programming and Combinatorial Optimization$9772247 997 $aUNISA