04375oam 2200589 450 99646613790331620210714195452.03-540-69346-710.1007/3-540-69346-7(CKB)1000000000210930(SSID)ssj0000324038(PQKBManifestationID)11241172(PQKBTitleCode)TC0000324038(PQKBWorkID)10303636(PQKB)10341211(DE-He213)978-3-540-69346-8(MiAaPQ)EBC3072038(MiAaPQ)EBC6485796(PPN)15523434X(EXLCZ)99100000000021093020210714d1998 uy 0engurnn|008mamaatxtccrInteger programming and combinatorial optimization 6th International IPCO Conference, Houston, Texas, June 22-24, 1998 : proceedings /Robert E. Bixby, E. Andrew Boyd, Roger Z. Ríos-Mercado (editors)1st ed. 1998.Berlin, Germany :Springer,[1998]©19981 online resource (IX, 435 p. 55 illus., 18 illus. in color.) Lecture Notes in Computer Science,0302-9743 ;1412Bibliographic Level Mode of Issuance: Monograph3-540-64590-X Includes bibliographical references and index.0,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.Lecture Notes in Computer Science,0302-9743 ;1412Combinatorial optimizationCongressesInteger programmingCongressesCombinatorial optimizationInteger programming519.77Ríos-Mercado Roger Z.Bixby Robert1952-2012,Boyd E. AndrewMiAaPQMiAaPQUtOrBLWBOOK996466137903316Integer Programming and Combinatorial Optimization772247UNISA