Abstract is missing.
- Improved Approximation Algorithms for MAX ::::k::::-CUT and MAX BISECTIONAlan M. Frieze, Mark Jerrum. 1-13
- Approximating Minimum Feedback Sets and Multi-Cuts in Directed GraphsGuy Even, Joseph Naor, Baruch Schieber, Madhu Sudan. 14-28
- Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut ProblemsDimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra. 29-39
- Separating Clique Tree and Bipartition Inequalities in Polynominal TimeRobert D. Carr. 40-49
- The Interval Order Polytope of a DigraphRudolf Müller, Andreas S. Schulz. 50-64
- Separation Problems for the Stable Set PolytopeEddie Cheng, William H. Cunningham. 65-79
- Computational Study of a Family of Mixed-Integer Quadratic Programming ProblemsDaniel Bienstock. 80-94
- A Minimal Algorithm for the Bounded Knapsack ProblemDavid Pisinger. 95-109
- A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS ProblemsLaureano F. Escudero, Silvano Martello, Paolo Toth. 110-123
- Combining Semidefinite and Polyhedral Relaxations for Integer ProgramsChristoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz. 124-134
- Distributed Near-Optimal MatchingXiaotie Deng. 135-144
- The Random Linear Bottleneck Assignment ProblemUlrich Pferschy. 145-156
- On Implementing Push-Relabel Method for the Maximum Flow ProblemBoris V. Cherkassky, Andrew V. Goldberg. 157-171
- Use of Hidden Network Structure in the Set Partitioning ProblemAgha Iqbal Ali, Hyun-Soo Han, Jeffery L. Kennington. 172-184
- Generalized Max Flows and Augmenting PathsDavid Hartvigsen. 185-197
- Oriented Matroid Polytopes and Polyhedral Fans are SignablePeter Kleinschmidt, Shmuel Onn. 198-211
- On Combinatorial Properties of Binary SpacesBeth Novick, András Sebö. 212-227
- Coverings and Delta-CoveringsAndré Bouchet. 228-243
- The Topological Structure of Maximal Lattice Free Convex Bodies: The General CaseImre Bárány, Herbert E. Scarf, David Shallcross. 244-251
- The Hilbert Basis of the Cut Cone over the Complete Graph ::::K::::::6::François Laburthe. 252-266
- GRIN: An Implementation of Gröbner Bases for Integer ProgrammingSerkan Hosten, Bernd Sturmfels. 267-276
- Scheduling Jobs of Equal Length: Complexity, Facets and Computational ResultsYves Crama, Frits C. R. Spieksma. 277-291
- Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion TimesHan Hoogeveen, Steef L. van de Velde. 292-306
- Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary SpeedsMaurice Queyranne, Andreas S. Schulz. 307-320
- A Mickey-Mouse Decomposition TheoremMichele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic. 321-328
- Minimum Cost Dynamic Flows: The Series-Parallel CaseBettina Klinz, Gerhard J. Woeginger. 329-343
- (0, ±1) Ideal MatricesPaolo Nobili, Antonio Sassano. 344-359
- Embedding Graphs in the Torus in Linear TimeMartin Juvan, Joze Marincek, Bojan Mohar. 360-363
- A Characterization of Seymour GraphsAlexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti. 364-372
- The Markov Chain of ColouringsJ. Eric Bartels, Dominic Welsh. 373-387
- Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated GraphsHarold N. Gabow, K. S. Manu. 388-402
- A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation ProblemHiroshi Nagamochi, Toshihide Ibaraki. 403-413
- How to Make a Strongly Connected Digraph Two-ConnectedAndrás Frank, Tibor Jordán. 414-425
- Polyhedra and Optimization in Connection with a Weak Majorization OrderingGeir Dahl. 426-437
- Combining and Strengthening Gomory CutsSebastián Ceria, Gérard Cornuéjols, Milind Dawande. 438-451
- Sequence Independent Lifting of Cover InequalitiesZonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh. 452-461