LEADER 04448oam 2200637 450 001 996465288603316 005 20210723010750.0 010 $a1-280-80488-2 010 $a9786610804887 010 $a3-540-48777-8 024 7 $a10.1007/3-540-48777-8 035 $a(CKB)1000000000211173 035 $a(EBL)3036556 035 $a(SSID)ssj0000299863 035 $a(PQKBManifestationID)11223538 035 $a(PQKBTitleCode)TC0000299863 035 $a(PQKBWorkID)10242825 035 $a(PQKB)11663751 035 $a(DE-He213)978-3-540-48777-7 035 $a(MiAaPQ)EBC3036556 035 $a(MiAaPQ)EBC6489726 035 $a(PPN)155187503 035 $a(EXLCZ)991000000000211173 100 $a20210723d1999 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aInteger programming and combinatorial optimization $e7th International IPCO Conference, Graz, Austria, June 9-11, 1999 : proceedings /$fedited by Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger 205 $a1st ed. 1999. 210 1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[1999] 210 4$d©1999 215 $a1 online resource (462 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1610 300 $aDescription based upon print version of record. 311 $a3-540-66019-4 320 $aIncludes bibliographical references and index. 327 $aMarket Split and Basis Reduction: Towards a Solution of the Cornujols-Dawande Instances -- Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts -- Solving the Convex Cost Integer Dual Network Flow Problem -- Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem -- Valid Inequalities for Problems with Additive Variable Upper Bounds -- A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version) -- On the Separation of Maximally Violated mod-k Cuts -- Improved Approximation Algorithms for Capacitated Facility Location Problems -- Optimal 3-Terminal Cuts and Linear Programming -- Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem -- Bounds on the Chvtal Rank of Polytopes in the 0/1-Cube -- Universally Maximum Flow with Piecewise-Constant Capacities -- Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope -- An Orientation Theorem with Parity Conditions -- Parity Constrained k-Edge-Connected Orientations -- Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs -- On the Chvtal Rank of Certain Inequalities -- The Square-Free 2-Factor Problem in Bipartite Graphs -- The m-Cost ATSP -- A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem -- Edge-Splitting Problems with Demands -- Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors -- Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract) -- On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms -- Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow -- Approximation Algorithms for a Directed Network Design Problem -- Optimizing over All Combinatorial Embeddings of a Planar Graph (Extended Abstract) -- A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts -- Scheduling Two Machines with Release Times -- An Introduction to Empty Lattice Simplices -- On Optimal Ear-Decompositions of Graphs -- Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract) -- Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1610 606 $aInteger programming$vCongresses 606 $aCombinatorial optimization$vCongresses 615 0$aInteger programming 615 0$aCombinatorial optimization 676 $a519.77 702 $aWoeginger$b Gerhard 702 $aCornuejols$b Gerard$f1950- 702 $aBurkard$b Rainer E. 712 12$aConference on Integer Programming and Combinatorial Optimization$d(7th :$f1999 :$eGraz, Austria) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996465288603316 996 $aInteger Programming and Combinatorial Optimization$9772247 997 $aUNISA