LEADER 05543oam 2200613 450 001 9910143906203321 005 20210521142351.0 010 $a3-540-47867-1 024 7 $a10.1007/3-540-47867-1 035 $a(CKB)1000000000211733 035 $a(SSID)ssj0000318333 035 $a(PQKBManifestationID)11241974 035 $a(PQKBTitleCode)TC0000318333 035 $a(PQKBWorkID)10310512 035 $a(PQKB)10499252 035 $a(DE-He213)978-3-540-47867-6 035 $a(MiAaPQ)EBC3062287 035 $a(MiAaPQ)EBC6414007 035 $z(PPN)123720389 035 $a(PPN)155223690 035 $a(EXLCZ)991000000000211733 100 $a20210521d2002 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aInteger programming and combinatorial optimization $e9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002 : proceedings /$fWilliam J. Cook, Andreas S. Schulz (eds.) 205 $a1st ed. 2002. 210 1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[2002] 210 4$d©2002 215 $a1 online resource (XI, 487 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2337 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-43676-6 320 $aIncludes bibliographical references and index. 327 $aA Faster Scaling Algorithm for Minimizing Submodular Functions -- A Generalization of Edmonds? Matching and Matroid Intersection Algorithms -- A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization -- The Quickest Multicommodity Flow Problem -- A New Min-Cut Max-Flow Ratio for Multicommodity Flows -- Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems -- Finding the Exact Integrality Gap for Small Traveling Salesman Problems -- Polynomial-Time Separation of Simple Comb Inequalities -- A New Approach to Cactus Construction Applied to TSP Support Graphs -- Split Closure and Intersection Cuts -- An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs -- Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms -- On a Lemma of Scarf -- A Short Proof of Seymour?s Characterization of the Matroids with the Max-Flow Min-Cut Property -- Integer Programming and Arrovian Social Welfare Functions -- Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design -- The Minimum Latency Problem Is NP-Hard for Weighted Trees -- An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem -- A Polyhedral Approach to Surface Reconstruction from Planar Contours -- The Semidefinite Relaxation of the k-Partition Polytope Is Strong -- A Polyhedral Study of the Cardinality Constrained Knapsack Problem -- A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling -- An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem -- On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes -- Hard Equality Constrained Integer Knapsacks -- The Distribution of Values in the Quadratic Assignment Problem -- A New Subadditive Approach to Integer Programming -- Improved Approximation Algorithms for Resource Allocation -- Approximating the Advertisement Placement Problem -- Algorithms for Minimizing Response Time in Broadcast Scheduling -- Building Edge-Failure Resilient Networks -- The Demand Matching Problem -- The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap. 330 $aThis volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27?29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2337 606 $aInteger programming$vCongresses 606 $aCombinatorial optimization$vCongresses 615 0$aInteger programming 615 0$aCombinatorial optimization 676 $a519.7/7 702 $aCook$b William J.$f1936- 702 $aSchulz$b Andreas S. 712 12$aConference on Integer Programming and Combinatorial Optimization 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910143906203321 996 $aInteger Programming and Combinatorial Optimization$9772247 997 $aUNINA