6. IPCO 1998: Houston, Texas, USA

Robert E. Bixby, E. Andrew Boyd, Roger Z. Ríos-Mercado (Eds.): Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings. Lecture Notes in Computer Science 1412 Springer 1998, ISBN 3-540-64590-X

0, 1 Matrices, Matroids

Gérard Cornuéjols, Bertrand Guenin, François Margot:
The Packing Property. 1-8
Bertrand Guenin:
A Characterization of Weakly Bipartite Graphs. 9-22
Grigor Gasparyan:
Bipartite Designs. 23-36
András Sebö:
Characterizing Noninteger Polyhedra with 0-1 Constraints. 37-52
Michele Conforti, Ajai Kapoor:
A Theorem of Truemper. 53-68
Daishin Nakamura, Akihisa Tamura:
The Generalized Stable Set Problem for Claw-Free Bidirected Graphs. 69-83
Zoltán Szigeti:
On a Min-max Theorem of Cacti. 84-95

Hiroshi Nagamochi, Peter Eades:
Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. 96-111
Robert Carr, R. Ravi:
A New Bound for the 2-Edge Connected Subgraph Problem. 112-125
Joseph Cheriyan, András Sebö, Zoltán Szigeti:
An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. 126-136

Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed:
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. 137-152
Stavros G. Kolliopoulos, Clifford Stein:
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. 153-168
Balaji Raghavachari, Jeyakesavan Veerasamy:
Approximation Algorithms for the Mixed Postman Problem. 169-179
Fabián A. Chudak:
Improved Approximation Algorithms for Uncapitated Facility Location. 180-194
Alexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe:
The Maximum Traveling Salesman Problem Under Polyhedral Norms. 195-201

Hernán G. Abeledo, Gary Atkinson:
Polyhedral Combinatorics of Benzenoid Problems. 202-212
Thomas Christof, Marcus Oswald, Gerhard Reinelt:
Consecutive Ones and a Betweenness Problem in Computational Biology. 213-228
Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra:
Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. 229-242

Alexander Martin, Robert Weismantel:
The Intersection of Knapsack Polyhedra and Extensions. 243-256
Sándor P. Fekete, Jörg Schepers:
New Classes of Lower Bounds for Bin Packing Problems. 257-270
Sebastián Ceria, Gábor Pataki:
Solving Integer and Disjunctive Programs by Lift and Project. 271-283
Gérard Cornuéjols, Milind Dawande:
A Class of Hard Small 0-1 Programs. 284-293

Lisa Fleischer:
Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. 294-309
Éva Tardos, Kevin D. Wayne:
Simple Generalized Maximum Flow Algorithms. 310-324
Dorit S. Hochbaum:
The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem. 325-337
Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein:
An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. 338-352

Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger:
Non-approximability Results for Scheduling Problems with Minsum Criteria. 353-366
Alix Munier, Maurice Queyranne, Andreas S. Schulz:
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. 367-382
Chandra Chekuri, Michael A. Bender:
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. 383-393
R. N. Uma, Joel Wein:
On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems. 394-408

Volker Kaibel:
Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations. 409-422
Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl:
Incorporating Inequality Constraints in the Spectral Bundle Method. 423-436