LEADER 06307nam 22007215 450 001 996466121203316 005 20230406062840.0 010 $a9783540321026 024 7 $a10.1007/b137143 035 $a(CKB)1000000000213052 035 $a(SSID)ssj0000318334 035 $a(PQKBManifestationID)11226185 035 $a(PQKBTitleCode)TC0000318334 035 $a(PQKBWorkID)10310513 035 $a(PQKB)10566507 035 $a(DE-He213)978-3-540-32102-6 035 $a(MiAaPQ)EBC3067751 035 $a(PPN)123095301 035 $a(EXLCZ)991000000000213052 100 $a20100715d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aInteger Programming and Combinatorial Optimization$b[electronic resource] $e11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings /$fedited by Michael Jünger, Volker Kaibel 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XII, 488 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3509 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-32102-0 311 $a3-540-26199-0 320 $aIncludes bibliographical references and index. 327 $aMixed-Integer Cuts from Cyclic Groups -- Optimizing over the First Chvàtal Closure -- Sequential Pairing of Mixed Integer Inequalities -- Approximate Min-max Relations for Odd Cycles in Planar Graphs -- Disjoint Cycles: Integrality Gap, Hardness, and Approximation -- A Combinatorial Algorithm to Find a Maximum Even Factor -- Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems -- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem -- Inventory and Facility Location Models with Market Selection -- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations -- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials -- Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring -- On the Inefficiency of Equilibria in Congestion Games -- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times -- LP-Based Online Scheduling: From Single to Parallel Machines -- Unique Sink Orientations of Grids -- Jumping Doesn?t Help in Abstract Cubes -- Computing the Inertia from Sign Patterns -- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem -- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem -- Smoothed Analysis of Integer Programming -- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs -- Approximation Algorithms for Stochastic Inventory Control Models -- On Two-Stage Stochastic Minimum Spanning Trees -- Combinatorial Analysis of Generic Matrix Pencils -- Power Optimization for Connectivity Problems -- Packing Steiner Forests -- Bidimensional Packing by Bilinear Programming -- On the L ???-Norm of Extreme Points for Crossing Supermodular Directed Network LPs -- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks -- Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem -- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems -- A Study of Domino-Parity and k-Parity Constraints for the TSP -- Not Every GTSP Facet Induces an STSP Facet. 330 $aSince its start in 1990, the IPCO conference series (held under the auspices of theMathematicalProgrammingSociety)hasbecomeanimportantforumforthe presentation of recent results in Integer Programming and Combinatorial Op- mization. This volume compiles the papers presented at IPCO XI, the eleventh conference in this series, held June 8?10, 2005, at the Technische Universitš at Berlin. The high interest in this conference series is evident in the large number of submissions. For IPCO XI, 119 extended abstracts of up to 10 pages were submitted. During its meeting on January 29?30, 2005, the Program Committee carefully selected 34 contributions for presentation in non-parallel sessions at the conference. The ?nal choices were not easy at all, since, due to the limited number of time slots, many very good papers could not be accepted. During the selection process the contributions were refereed according to the standards of refereed conferences. As a result of this procedure, you have in your hands a volume that contains papers describing high-quality research e?orts. The page limit for contributions to this proceedings volume was set to 15. You may ?nd full versions of the papers in scienti?c journals in the near future. We thank all the authors who submitted papers. Furthermore, the Program Committee is indebted to the many reviewers who, with their speci?c expertise, helped a lot in making the decisions. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3509 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aAlgorithms 606 $aComputer graphics 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aAlgorithms 606 $aComputer Graphics 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aAlgorithms. 615 24$aComputer Graphics. 676 $a519.77 702 $aJünger$b Michael$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKaibel$b Volker$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aConference on Integer Programming and Combinatorial Optimization 906 $aBOOK 912 $a996466121203316 996 $aInteger Programming and Combinatorial Optimization$92860150 997 $aUNISA