LEADER 06819nam 22007815 450 001 996466067503316 005 20200706104715.0 010 $a3-540-45535-3 024 7 $a10.1007/3-540-45535-3 035 $a(CKB)1000000000211491 035 $a(SSID)ssj0000324037 035 $a(PQKBManifestationID)11268860 035 $a(PQKBTitleCode)TC0000324037 035 $a(PQKBWorkID)10305013 035 $a(PQKB)11707982 035 $a(DE-He213)978-3-540-45535-6 035 $a(MiAaPQ)EBC3071971 035 $a(PPN)155233882 035 $a(EXLCZ)991000000000211491 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aInteger Programming and Combinatorial Optimization$b[electronic resource] $e8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings /$fedited by Karen Aardal, Bert Gerards 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XII, 428 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2081 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42225-0 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aTwo O(log* k)-Approximation Algorithms for the Asymmetric k-Center Problem -- Strongly Polynomial Algorithms for the Unsplittable Flow Problem -- Edge Covers of Setpairs and the Iterative Rounding Method -- The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates -- Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation -- On the Rank of Mixed 0,1 Polyhedra -- Fast 2-Variable Integer Programming -- Approximating k-Spanner Problems for k > 2 -- A Matroid Generalization of the Stable Matching Polytope -- A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity -- Combined Connectivity Augmentation and Orientation Problems -- An Extension of a Theorem of Henneberg and Laman -- Bisubmodular Function Minimization -- On the Integrality Gap of a Natural Formulation of the Single-sink Buy-at-Bulk Network Design Problem -- Circuit Mengerian Directed Graphs -- Integral Polyhedra Related to Even Cycle and Even Cut Matroids -- A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems -- Synthesis of 2-Commodity Flow Networks -- Bounds for Deterministic Periodic Routing sequences -- Cutting Planes for Mixed 0-1 Semidefinite Programs -- Independence Free Graphs and Vertex connectivity Augmentation -- The Throughput of Sequential Testing -- An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs -- Pruning by Isomorphism in Branch-and-Cut -- Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times -- Fences Are Futile: On Relaxations for the Linear Ordering Problem -- Generating Cuts from Multiple-Term Disjunctions -- A (2+?)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective -- Performance Guarantees of Local Search for Multiprocessor Scheduling -- connected Joins in Graphs -- Two NP-hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines -- Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. 330 $aThis volume contains the papers selected for presentation at IPCO VIII, the Eighth Conference on Integer Programming and Combinatorial Optimization, Utrecht, The Netherlands, 2001. This meeting isa forum for researchers and practitioners working on various aspects of integer programming and combi- torial optimization. The aim is to present recent developments in theory, com- tation, and application of integer programming and combinatorial optimization. Topics include, but are not limited to: approximation algorithms, branch and bound algorithms, computational biology, computational complexity, compu- tional geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semide nit e programs. IPCO was established in 1988 when the rs t IPCO program committee was formed. The locations and years of the seven rs t IPCO conferences were: IPCO I, Waterloo (Canada) 1990, IPCO II, Pittsburgh (USA) 1992, IPCO III, - ice (Italy) 1993, IPCO IV, Copenhagen (Denmark) 1995, IPCO V, Vancouver (Canada) 1996, IPCO VI, Houston (USA) 1998, IPCO VII, Graz (Austria) 1999. IPCO is held every year in which no MPS (Mathematical Programming Society) International Symposium takes place. Since the MPS meeting is triennial, IPCO conferences are held twice in every three-year period. Asa rule, IPCO is held somewhere in Northern America in even years, and somewhere in Europe in odd years. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2081 606 $aProbabilities 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aInformation technology 606 $aBusiness?Data processing 606 $aCombinatorics 606 $aProbability Theory and Stochastic Processes$3https://scigraph.springernature.com/ontologies/product-market-codes/M27004 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aIT in Business$3https://scigraph.springernature.com/ontologies/product-market-codes/522000 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aProbabilities. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aInformation technology. 615 0$aBusiness?Data processing. 615 0$aCombinatorics. 615 14$aProbability Theory and Stochastic Processes. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aIT in Business. 615 24$aCombinatorics. 676 $a519.77 702 $aAardal$b Karen$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGerards$b Bert$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466067503316 996 $aInteger Programming and Combinatorial Optimization$9772247 997 $aUNISA