The topological structure of maximal lattice free convex bodies: The general case I. BárányH. E. ScarfD. Shallcross OriginalPaper Pages: 1 - 15
Strongly polynomial dual simplex methods for the maximum flow problem Ronald D. ArmstrongWei ChenZhiying Jin OriginalPaper Pages: 17 - 33
Partitioning mathematical programs for parallel solution Michael C. FerrisJeffrey D. Horn OriginalPaper Pages: 35 - 61
Rounding algorithms for covering problems Dimitris BertsimasRakesh Vohra OriginalPaper Pages: 63 - 89
On the complexity of linear programming under finite precision arithmetic Jorge R. Vera OriginalPaper Pages: 91 - 123
International conference on Nonlinear Programming and Variational Inequalities First Announcement Pages: 127 - 128