1. The topological structure of maximal lattice free convex bodies: The general case

   • I. Bárány
   • H. E. Scarf
   • D. Shallcross

   OriginalPaper Pages: 1 - 15

2. Strongly polynomial dual simplex methods for the maximum flow problem

   • Ronald D. Armstrong
   • Wei Chen
   • Zhiying Jin

   OriginalPaper Pages: 17 - 33

3. Partitioning mathematical programs for parallel solution

   • Michael C. Ferris
   • Jeffrey D. Horn

   OriginalPaper Pages: 35 - 61

4. Rounding algorithms for covering problems

   • Dimitris Bertsimas
   • Rakesh Vohra

   OriginalPaper Pages: 63 - 89

5. On the complexity of linear programming under finite precision arithmetic

   • Jorge R. Vera

   OriginalPaper Pages: 91 - 123

6. Erratum

   Erratum Pages: 125 - 125

7. International conference on Nonlinear Programming and Variational Inequalities

   First Announcement Pages: 127 - 128