Abstract is missing.
- The Packing PropertyGérard Cornuéjols, Bertrand Guenin, François Margot. 1-8 [doi]
- A Characterization of Weakly Bipartite GraphsBertrand Guenin. 9-22 [doi]
- Bipartite DesignsGrigor Gasparyan. 23-36 [doi]
- Characterizing Noninteger Polyhedra with 0-1 ConstraintsAndrás Sebö. 37-52 [doi]
- A Theorem of TruemperMichele Conforti, Ajai Kapoor. 53-68 [doi]
- The Generalized Stable Set Problem for Claw-Free Bidirected GraphsDaishin Nakamura, Akihisa Tamura. 69-83 [doi]
- On a Min-max Theorem of CactiZoltán Szigeti. 84-95 [doi]
- Edge-Splitting and Edge-Connectivity Augmentation in Planar GraphsHiroshi Nagamochi, Peter Eades. 96-111 [doi]
- A New Bound for the 2-Edge Connected Subgraph ProblemRobert Carr, R. Ravi. 112-125 [doi]
- An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning SubgraphsJoseph Cheriyan, András Sebö, Zoltán Szigeti. 126-136 [doi]
- Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-WidthGruia Calinescu, Cristina G. Fernandes, Bruce A. Reed. 137-152 [doi]
- Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer ProgramsStavros G. Kolliopoulos, Clifford Stein. 153-168 [doi]
- Approximation Algorithms for the Mixed Postman ProblemBalaji Raghavachari, Jeyakesavan Veerasamy. 169-179 [doi]
- Improved Approximation Algorithms for Uncapitated Facility LocationFabián A. Chudak. 180-194 [doi]
- The Maximum Traveling Salesman Problem Under Polyhedral NormsAlexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe. 195-201 [doi]
- Polyhedral Combinatorics of Benzenoid ProblemsHernán G. Abeledo, Gary Atkinson. 202-212 [doi]
- Consecutive Ones and a Betweenness Problem in Computational BiologyThomas Christof, Marcus Oswald, Gerhard Reinelt. 213-228 [doi]
- Solving a Linear Diophantine Equation with Lower and Upper Bounds on the VariablesKaren Aardal, Cor A. J. Hurkens, Arjen K. Lenstra. 229-242 [doi]
- The Intersection of Knapsack Polyhedra and ExtensionsAlexander Martin, Robert Weismantel. 243-256 [doi]
- New Classes of Lower Bounds for Bin Packing ProblemsSándor P. Fekete, Jörg Schepers. 257-270 [doi]
- Solving Integer and Disjunctive Programs by Lift and ProjectSebastián Ceria, Gábor Pataki. 271-283 [doi]
- A Class of Hard Small 0-1 ProgramsGérard Cornuéjols, Milind Dawande. 284-293 [doi]
- Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run TimeLisa Fleischer. 294-309 [doi]
- Simple Generalized Maximum Flow AlgorithmsÉva Tardos, Kevin D. Wayne. 310-324 [doi]
- The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow ProblemDorit S. Hochbaum. 325-337 [doi]
- An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity FlowAndrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein. 338-352 [doi]
- Non-approximability Results for Scheduling Problems with Minsum CriteriaHan Hoogeveen, Petra Schuurman, Gerhard J. Woeginger. 353-366 [doi]
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling ProblemsAlix Munier, Maurice Queyranne, Andreas S. Schulz. 367-382 [doi]
- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related MachinesChandra Chekuri, Michael A. Bender. 383-393 [doi]
- On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling ProblemsR. N. Uma, Joel Wein. 394-408 [doi]
- Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than LocationsVolker Kaibel. 409-422 [doi]
- Incorporating Inequality Constraints in the Spectral Bundle MethodChristoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl. 423-436 [doi]