1. Minimum cost spanning tree games

   • Daniel Granot
   • Gur Huberman

   OriginalPaper Pages: 1 - 18

2. A restricted Lagrangean approach to the traveling salesman problem

   • Egon Balas
   • Nicos Christofides

   OriginalPaper Pages: 19 - 46

3. The octahedral algorithm, a new simplicial fixed point algorithm

   • Alden H. Wright

   OriginalPaper Pages: 47 - 69

4. Polyhedra related to a lattice

   • V. P. Grishuhin

   OriginalPaper Pages: 70 - 89

5. Identification of special structure constraints in linear programs

   • Gamini Gunawardane
   • Stephen Hoff
   • Linus Schrage

   OriginalPaper Pages: 90 - 97

6. An algorithm for linear least squares problems with equality and nonnegativity constraints

   • Karen H. Haskell
   • Richard J. Hanson

   OriginalPaper Pages: 98 - 118

7. Institute on deterministic and stochastic scheduling

   Notice Pages: 119 - 119

8. Symposium on network flows

   Notice Pages: 120 - 120

9. Polynomial algorithms for a class of linear programs

   • J. F. Maurras
   • K. Truemper
   • M. Akgül

   OriginalPaper Pages: 121 - 136

10. Entropy in linear programs

    • Sven Erlander

    OriginalPaper Pages: 137 - 151

11. A new algorithm for the assignment problem

    • Dimitri P. Bertsekas

    OriginalPaper Pages: 152 - 171

12. A note about sparsity exploiting quasi-Newton updates

    • Ph. Toint

    OriginalPaper Pages: 172 - 181

13. An algorithm for computing equilibria in a linear monetary economy

    • Roger B. Myerson

    OriginalPaper Pages: 182 - 189

14. On the number of solutions to a class of complementarity problems

    • M. Kojima
    • R. Saigal

    OriginalPaper Pages: 190 - 203

15. Multicriteria integer programming: A (hybrid) dynamic programming recursive approach

    • Bernardo Villarreal
    • Mark H. Karwan

    OriginalPaper Pages: 204 - 223

16. One way to solve the parametric quadratic programming problem

    • Regina Benveniste

    Short Communication Pages: 224 - 228

17. Comment on a paper by M.C. Cheng

    • L. Brosius

    Short Communication Pages: 229 - 232

18. Finding simplicial subdivisions of polytopes

    • B. Von Hohenbalken

    Short Communication Pages: 233 - 234

19. Constrained definite Hessians tend to be well conditioned

    • G. W. Stewart

    Short Communication Pages: 235 - 238

20. Sixth symposium on operations research

    Notice Pages: 239 - 239

21. Euro V — tims XXV

    Notice Pages: 240 - 240

22. An elementary survey of general duality theory in mathematical programming

    • Jorgen Tind
    • Laurence A. Wolsey

    OriginalPaper Pages: 241 - 261

23. Equilibrium programming:The path following approach and dynamics

    • W. I. Zangwill
    • C. B. Garcia

    OriginalPaper Pages: 262 - 289

24. A global quadratic algorithm for solving a system of mixed equalities and inequalities

    • U. M. Garcia-Palomares
    • A. Restuccia

    OriginalPaper Pages: 290 - 300

25. Direct theorems in semi-infinite convex programming

    • J. M. Borwein

    OriginalPaper Pages: 301 - 318

26. On solving a primal geometric program by partial dual optimization

    • Eric Rosenberg

    OriginalPaper Pages: 319 - 330

27. The application of optimal control methodology to nonlinear programming problems

    • Daniel M. Murray
    • Sidney J. Yakowitz

    OriginalPaper Pages: 331 - 347

28. A statistical estimate of the structure of multi-extremal problems

    • Ryszard Zieliński

    OriginalPaper Pages: 348 - 356

29. Erratum

    • T. F. Coleman
    • A. R. Conn

    Notice Pages: 357 - 357

30. International symposium on the occasion of the 25th anniversary of the econometric institute, rotterdam

    Notice Pages: 358 - 358