Integer Programming and Combinatorial Optimization: 8th International IPCO Conference Utrecht, The Netherlands, June 13–15, 2001 Proceedings

✍ Scribed by Aaron Archer (auth.), Karen Aardal, Bert Gerards (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2001
• Tongue: English
• Leaves: 431
• Series: Lecture Notes in Computer Science 2081
• Edition: 1
• Category: Library

✦ Synopsis

This 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.

✦ Table of Contents

Two O (log * k )-Approximation Algorithms for the Asymmetric k -Center Problem....Pages 1-14
Strongly Polynomial Algorithms for the Unsplittable Flow Problem....Pages 15-29
Edge Covers of Setpairs and the Iterative Rounding Method....Pages 30-44
The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates....Pages 45-59
Approximate k -MSTs and k -Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation....Pages 60-70
On the Rank of Mixed 0,1 Polyhedra....Pages 71-77
Fast 2-Variable Integer Programming....Pages 78-89
Approximating k -Spanner Problems for k > 2....Pages 90-104
A Matroid Generalization of the Stable Matching Polytope....Pages 105-114
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity....Pages 115-129
Combined Connectivity Augmentation and Orientation Problems....Pages 130-144
An Extension of a Theorem of Henneberg and Laman....Pages 145-159
Bisubmodular Function Minimization....Pages 160-169
On the Integrality Gap of a Natural Formulation of the Single-sink Buy-at-Bulk Network Design Problem....Pages 170-184
Circuit Mengerian Directed Graphs....Pages 185-195
Integral Polyhedra Related to Even Cycle and Even Cut Matroids....Pages 196-209
A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems....Pages 210-225
Synthesis of 2-Commodity Flow Networks....Pages 226-235
Bounds for Deterministic Periodic Routing sequences....Pages 236-250
Cutting Planes for Mixed 0-1 Semidefinite Programs....Pages 251-263
Independence Free Graphs and Vertex connectivity Augmentation....Pages 264-279
The Throughput of Sequential Testing....Pages 280-292
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs....Pages 293-303
Pruning by Isomorphism in Branch-and-Cut....Pages 304-317
Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times....Pages 318-332
Fences Are Futile: On Relaxations for the Linear Ordering Problem....Pages 333-347
Generating Cuts from Multiple-Term Disjunctions....Pages 348-360
A (2+ε)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective....Pages 361-369
Performance Guarantees of Local Search for Multiprocessor Scheduling....Pages 370-382
connected Joins in Graphs....Pages 383-395
Two NP-hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines....Pages 396-405
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem....Pages 406-421

✦ Subjects

Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Business Information Systems; Combinatorics