Front matter
1-8
The Packing Property
Gérard Cornuéjols, Bertrand Guenin and François Margot
9-22
A Characterization of Weakly Bipartite Graphs
Bertrand Guenin
23-36
Bipartite Designs
Grigor Gasparyan
37-52
Characterizing Noninteger Polyhedra with 0–1 Constraints
András Sebő
53-68
A Theorem of Truemper
Michele Conforti and Ajai Kapoor
69-83
The Generalized Stable Set Problem for Claw-Free Bidirected Graphs
Daishin Nakamura and Akihisa Tamura
84-95
On a Min-max Theorem of Cacti
Zoltán Szigeti
96-111
Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs
Hiroshi Nagamochi and Peter Eades
112-125
A New Bound for the 2-Edge Connected Subgraph Problem
Robert Carr and R. Ravi
126-136
An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs
Joseph Cheriyan, András Sebő and Zoltán Szigeti
137-152
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width
Gruia Călinescu, Cristina G. Fernandes and Bruce Reed
153-168
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs
Stavros G. Kolliopoulos and Clifford Stein
169-179
Approximation Algorithms for the Mixed Postman Problem
Balaji Raghavachari and Jeyakesavan Veerasamy
180-194
Improved Approximation Algorithms for Uncapacitated Facility Location
Fabián A. Chudak
195-201
The Maximum Traveling Salesman Problem Under Polyhedral Norms
Alexander Barvinok, David S. Johnson, Gerhard J. Woeginger and Russell Woodroofe
202-212
Polyhedral Combinatorics of Benzenoid Problems
Hernán Abeledo and Gary Atkinson
213-228
Consecutive Ones and a Betweenness Problem in Computational Biology
Thomas Christof, Marcus Oswald and Gerhard Reinelt
229-242
Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables
Karen Aardal, Cor Hurkens and Arjen K. Lenstra
243-256
The Intersection of Knapsack Polyhedra and Extensions
Alexander Martin and Robert Weismantel
257-270
New Classes of Lower Bounds for Bin Packing Problems
Sándor P. Fekete and Jörg Schepers
271-283
Solving Integer and Disjunctive Programs by Lift and Project
Sebastián Ceria and Gábor Pataki
284-293
A Class of Hard Small 0—1 Programs
Gérard Cornuéjols and Milind Dawande
294-309
Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time
Lisa Fleischer
310-324
Simple Generalized Maximum Flow Algorithms
Éva Tardos and Kevin D. Wayne
325-337
The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem
Dorit S. Hochbaum
338-352
An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow
Andrew V. Goldberg, Jeffrey D. Oldham, Serge Plotkin and Cliff Stein
353-366
Non-approximability Results for Scheduling Problems with Minsum Criteria
Han Hoogeveen, Petra Schuurman and Gerhard J. Woeginger
367-382
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Alix Munier, Maurice Queyranne and Andreas S. Schulz
383-393
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
Chandra Chekuri and Michael Bender
394-408
On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems
R. N. Uma and Joel Wein
409-422
Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations
Volker Kaibel
423-435
Incorporating Inequality Constraints in the Spectral Bundle Method
Christoph Helmberg, Krzysztof C. Kiwiel and Franz Rendl
Back matter