1. A polynomial-time algorithm for a class of linear complementarity problems

   • Masakazu Kojima
   • Shinji Mizuno
   • Akiko Yoshise

   OriginalPaper Pages: 1 - 26

2. Interior path following primal-dual algorithms. part I: Linear programming

   • Renato D. C. Monteiro
   • Ilan Adler

   OriginalPaper Pages: 27 - 41

3. Interior path following primal-dual algorithms. part II: Convex quadratic programming

   • Renato D. C. Monteiro
   • Ilan Adler

   OriginalPaper Pages: 43 - 66

4. Marginal values in mixed integer linear programming

   • A. C. Williams

   OriginalPaper Pages: 67 - 75

5. On strongly degenerate complementary cones and solution rays

   • N. Eagambaram
   • S. R. Mohan

   OriginalPaper Pages: 77 - 83

6. Quadratically constrained minimum cross-entropy analysis

   • S. C. Fang
   • J. R. Rajasekera

   OriginalPaper Pages: 85 - 96

7. On the Windy Postman Problem on eulerian graphs

   • Zaw Win

   OriginalPaper Pages: 97 - 112

8. A constructive proof of a permutation-based generalization of Sperner's lemma

   • R. B. Bapat

   OriginalPaper Pages: 113 - 120

9. Directional derivatives for the value-function in semi-infinite programming

   • P. Zencke
   • R. Hettich

   Notice Pages: 121 - 121

10. Referees 1988

    Notice Pages: 123 - 125

11. Experiments in quadratic 0–1 programming

    • F. Barahona
    • M. Jünger
    • G. Reinelt

    OriginalPaper Pages: 127 - 137

12. Recognition problems for special classes of polynomials in 0–1 variables

    • Yves Crama

    OriginalPaper Pages: 139 - 155

13. An extension of Karmarkar's projective algorithm for convex quadratic programming

    • Yinyu Ye
    • Edison Tse

    OriginalPaper Pages: 157 - 179

14. On the facial structure of the set covering polytope

    • A. Sassano

    OriginalPaper Pages: 181 - 202

15. A randomized algorithm for fixed-dimensional linear programming

    • M. E. Dyer
    • A. M. Frieze

    OriginalPaper Pages: 203 - 212

16. A probabilistic analysis of the switching algorithm for the euclidean TSP

    • Walter Kern

    OriginalPaper Pages: 213 - 219

17. An inexact algorithm for composite nondifferentiable optimization

    • Stephen Wright

    OriginalPaper Pages: 221 - 234

18. Generalized edge packings

    • D. de Werra

    OriginalPaper Pages: 235 - 245

19. An extension of the simplex algorithm for semi-infinite linear programming

    • E. J. Anderson
    • A. S. Lewis

    OriginalPaper Pages: 247 - 269

20. Valid inequalities and facets of the capacitated plant location problem

    • Janny M. Y. Leung
    • Thomas L. Magnanti

    OriginalPaper Pages: 271 - 291

21. Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem

    • R. Chandrasekaran
    • A. Tamir

    OriginalPaper Pages: 293 - 295

22. An implementation of Karmarkar's algorithm for linear programming

    • Ilan Adler
    • Mauricio G. C. Resende
    • Narendra Karmarkar

    OriginalPaper Pages: 297 - 335

23. Sequential convexification in reverse convex and disjunctive programming

    • Egon Balas
    • Joseph M. Tama
    • Jørgen Tind

    OriginalPaper Pages: 337 - 350

24. An example of a nonregular semimonotoneQ-matrix

    • M. W. Jeter
    • W. C. Pye

    OriginalPaper Pages: 351 - 356

25. Global convergence of Rosen's gradient projection method

    • Ding-Zhu Du
    • Xiang-Sun Zhang

    OriginalPaper Pages: 357 - 366

26. Operations research 1990, international conference operations research

    Notice Pages: 367 - 367