1. On the computational behavior of a polynomial-time network flow algorithm

   • Robert G. Bland
   • David L. Jensen

   OriginalPaper Pages: 1 - 39

2. New scaling algorithms for the assignment and minimum mean cycle problems

   • James B. Orlin
   • Ravindra K. Ahuja

   OriginalPaper Pages: 41 - 56

3. Characterization of stable matchings as extreme points of a polytope

   • Uriel G. Rothblum

   OriginalPaper Pages: 57 - 67

4. Optimal partitions having disjoint convex and conic hulls

   • E. R. Barnes
   • A. J. Hoffman
   • Uriel G. Rothblum

   OriginalPaper Pages: 69 - 86

5. Extremal points and optimal solutions for general capacity problems

   • H. C. Lai
   • S. Y. Wu

   OriginalPaper Pages: 87 - 113

6. Persistency in quadratic 0–1 optimization

   • Alain Billionnet
   • Alain Sutter

   Short communication Pages: 115 - 119

7. Call for papers

   Notice Pages: 121 - 121

8. Announcement and Call for papers

   Notice Pages: 123 - 123

9. Call for nominations: The 1991 Lanchester Prize

   Notice Pages: 125 - 126

10. Local minima for indefinite quadratic knapsack problems

    • Stephen A. Vavasis

    OriginalPaper Pages: 127 - 153

11. A barrier function method for minimax problems

    • E. Polak
    • J. E. Higgins
    • D. Q. Mayne

    OriginalPaper Pages: 155 - 176

12. Modified barrier functions (theory and methods)

    • R. Polyak

    OriginalPaper Pages: 177 - 222

13. Convergence rates of a global optimization algorithm

    • Regina Hunter Mladineo

    OriginalPaper Pages: 223 - 232

14. On the best case performance of hit and run methods for detecting necessary constraints

    • R. J. Caron
    • M. Hlynka
    • J. F. McDonald

    OriginalPaper Pages: 233 - 249

15. Long steps in an O(n ³ L) algorithm for linear programming

    • Kurt M. Anstreicher
    • Robert A. Bosch

    OriginalPaper Pages: 251 - 265

16. An interior point potential reduction algorithm for the linear complementarity problem

    • Masakazu Kojima
    • Nimrod Megiddo
    • Yinyu Ye

    OriginalPaper Pages: 267 - 279

17. Crashing a maximum-weight complementary basis

    • Kurt M. Anstreicher
    • Jon Lee
    • Thomas F. Rutherford

    OriginalPaper Pages: 281 - 294

18. A polynomial method of approximate centers for linear programming

    • C. Roos
    • J. -Ph. Vial

    OriginalPaper Pages: 295 - 305

19. Finite dimensional approximation in infinite dimensional mathematical programming

    • Irwin E. Schochetman
    • Robert L. Smith

    OriginalPaper Pages: 307 - 333

20. Paths on polymatroids

    • Donald M. Topkis

    OriginalPaper Pages: 335 - 351

21. A time indexed formulation of non-preemptive single machine scheduling problems

    • Jorge P. Sousa
    • Laurence A. Wolsey

    OriginalPaper Pages: 353 - 367