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 BibTeX

@proceedings{DBLP:conf/ipco/1998,
  editor    = {Robert E. Bixby and
               E. Andrew Boyd and
               Roger Z. R\'{\i}os-Mercado},
  title     = {Integer Programming and Combinatorial Optimization, 6th International
               IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
  booktitle = {IPCO},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1412},
  year      = {1998},
  isbn      = {3-540-64590-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

0, 1 Matrices, Matroids

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

Edge Connectivity

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

Algorithms

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

Integer Programming Applications

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

Integer Programming Computation

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

Network Flows

Lisa Fleischer:
Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. 294-309
Electronic Edition (Springer LINK) BibTeX
Éva Tardos, Kevin D. Wayne:
Simple Generalized Maximum Flow Algorithms. 310-324
Electronic Edition (Springer LINK) BibTeX
Dorit S. Hochbaum:
The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem. 325-337
Electronic Edition (Springer LINK) BibTeX
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
Electronic Edition (Springer LINK) BibTeX

Scheduling

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

Quadratic Assignment Problems

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