Abstract is missing.
- The complex of maximal lattice free simplicesImre Bárány, Roger Howe, Herbert E. Scarf. 1-9
- Optimal solution and value of parametric integer programsRavi Kannan. 11-21
- On the monotonization of polyhedraEgon Balas, Matteo Fischetti. 23-38
- When cycles collapse: A general approximation technique for constrained two-connectivity problemsPhilip N. Klein, R. Ravi. 39-55
- An efficient approximation algorithm for the survivable network design problemHarold N. Gabow, Michel X. Goemans, David P. Williamson. 57-74
- Optimal and almost optimal algorithms for connectivity augmentation problemsTibor Jordán. 75-88
- An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphsAlexander Zelikovsky. 89-98
- Dynamic algorithms for optimization problems in bounded tree-width graphsRobert F. Cohen, Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter. 99-112
- Cycles of prescribed modularity in planar digraphsAnna Galluccio, Martin Loebl. 113-127
- Sequential and parallel algorithms for edge-coloring series-parallel multigraphsXiao Zhou, Hitoshi Suzuki, Takao Nishizeki. 129-145
- Computing the optimum stock sizeHans Kellerer, Franz Rendl, Gerhard J. Woeginger. 147-159
- On a characterization of the minimum assignment and matching in the independent random modelFlorin Avram, Dimitris Bertsimas. 161-169
- An analysis of a Monte Carlo algorithm for estimating the permanentMark Jerrum. 171-182
- A spectral approach to bandwidth and separator problems in graphsChristoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl. 183-194
- Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problemsJ. A. Hoogeveen, Steef L. van de Velde. 195-208
- Solving integer programs with Fenchel cutting planes and preprocessingE. Andrew Boyd. 209-220
- On the geodesic-structure of graphs: a polyhedral approach to metric decompositionMichael Lomonosov, András Sebö. 221-234
- On the (integral) maximum tw flow in vertex and edge capacitated planar graphsFrieda Granot, Michal Penn. 235-249
- An efficient implementation of a scaling minimum-cost flow algorithmAndrew V. Goldberg. 251-266
- Formulations for the stable set polytope of a claw-free graphWilliam R. Pulleyblank, F. Bruce Shepherd. 267-279
- A polyhedron with all s-t cuts as vertices, and adjacency of cutsNaveen Garg, Vijay V. Vazirani. 281-289
- Using path inequalities in a branch and cut code for the symmetric traveling salesman problemJean-Maurice Clochard, Denis Naddef. 291-311
- A new /frac34-approximation algorithm for MAX SATMichel X. Goemans, David P. Williamson. 313-321
- A nearly best-possible approximation algorithm for node-weighted Steiner treesPhilip N. Klein, R. Ravi. 323-332
- A primal-dual parallel approximation technique applied to weighted set and vertex coverSamir Khuller, Uzi Vishkin, Neal E. Young. 333-341
- Canceling most helpful total submodular cuts for submodular flowS. Thomas McCormick, Thomas R. Ervolina. 343-353
- Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systemsDimitris Bertsimas, José Niño-Mora. 355-384
- A general class of greedily solvable linear programsMaurice Queyranne, Frits C. R. Spieksma, Fabio Tardella. 385-399
- Delta-polymatroids and an extension of Edmonds-Giles TDI schemeMasataka Nakamura. 401-412
- On Lovász s cathedral theoremZoltán Szigeti. 413-423
- Nearly uniform scheduling of file transfersShin-Ichi Nakano, Takao Nishizeki. 425-431
- Circuit packings on surfaces with at most three cross-capsAndrás Sebö. 433-446
- Routing in grid graphs by cutting planesMartin Grötschel, Alexander Martin, Robert Weismantel. 447-461
- On the transitive acyclic subdigraph polytopeRudolf Müller. 463-477
- Solving the maximum weight planar subgraphMichael Jünger, Petra Mutzel. 479-492