Abstract is missing.
- Polyhedral Description of Trees and ArborescencesMichel X. Goemans. 1-14
- The K-Edge Connected Spanning Subgraph PolyhedronSunil Chopra. 15-29
- On 2-Connected Subgraph PolytopesFrancisco Barahona, Ali Ridha Mahjoub. 30-43
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per InequalityDorit S. Hochbaum, Joseph Naor. 44-59
- Efficient Enumeration of Grid Points in a Polygon and its Application to Integer ProgrammingNaoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano. 61-71
- Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex AlgorithmMartin E. Dyer, Alan M. Frieze. 72-84
- On Multiflow ProblemsAndrás Frank, Alexander V. Karzanov, András Sebö. 85-101
- Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of SymmetryFarhad Shahrokhi, László A. Székely. 102-113
- Recognition and Representation of Proper Circular Arc GraphsXiaotie Deng, Pavol Hell, Jing Huang. 114-121
- New Lower and Upper Bounds for Scheduling Around a Small Common Due DateJ. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde. 122-135
- Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine SchedulingJean B. Lasserre, Maurice Queyranne. 136-149
- Network Design with Divisible Capacities: Aggregated Flow and Knapsack SubproblemsYves Pochet, Laurence A. Wolsey. 150-164
- Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability ProblemPierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão. 165-180
- An Exact Algorithm for Makespan Minimisation on Unrelated Parallel MachinesSilvano Martello, François Soumis, Paolo Toth. 181-200
- A Separation Routine for the Set Covering PolytopePaolo Nobili, Antonio Sassano. 201-219
- A Complexity Index for Satisfiability ProblemsEndre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks. 220-226
- A Polynomial Time Dual Algorithm for the Euclidean Multifacility Location ProblemGuoliang Xue, J. Ben Rosen, Panos M. Pardalos. 227-236
- A Criterion of Polynomial-Time Solvability for the Network Location ProblemAlexander A. Ageev. 237-245
- Subgraph Degree-Sequence PolyhedraWilliam H. Cunningham, Fan Zhang. 246-259
- Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman PolytopeMatteo Fischetti. 260-273
- The Metric PolytopeMonique Laurent, Svatopluk Poljak. 274-286
- An Exact Characterization of Greedy StructuresPaul Helman, Bernard M. E. Moret, Henry D. Shapiro. 287-297
- Extended Polymatroids: Properties and OptimizationPartha P. Bhattacharya, Leonidas Georgiadis, Pantelis Tsoucas. 298-315
- Optimization Problems on Matroids and Exponential SumsAlexander I. Barvinok. 316-333
- Algorithms and Min-max Theorems for Certain Multiway CutsPéter L. Erdös, László A. Székely. 334-345
- Nasty TSP Instances for Farthest InsertionCor A. J. Hurkens. 346-352
- Forcing Colorations and the Strong Perfect Graph ConjectureAndrás Sebö. 353-366
- Fast Parallel Algorithms for Bipartite MatchingLov K. Grover. 367-384
- Combinatorial Optimization with Semi-Definite MatricesFarid Alizadeh. 385-405
- An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization ProblemsNarendra Karmarkar, S. A. Thakur. 406-420
- A Lot-Sizing Problem on Trees, Related to Network DesignDaniel Bienstock. 421-434
- A Technique for Speeding up the Solution of the Lagrangian DualDimitris Bertsimas, James B. Orlin. 435-452
- When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?Alan M. Frieze, Richard M. Karp, Bruce A. Reed. 453-461