1. Optimum matching forests I: Special weights

   • Rick Giles

   OriginalPaper Pages: 1 - 11

2. Optimum matching forests II: General weights

   • Rick Giles

   OriginalPaper Pages: 12 - 38

3. Optimum matching forests III: Facets of matching forest polyhedra

   • Rick Giles

   OriginalPaper Pages: 39 - 51

4. Rank of maximum matchings in a graph

   • Denis Naddef

   OriginalPaper Pages: 52 - 70

5. On the use of penumbras in blocking and antiblocking theory

   • Jørgen Tind
   • Laurence A. Wolsey

   OriginalPaper Pages: 71 - 81

6. On optimality conditions for structured families of nonlinear programming problems

   • J. E. Spingarn

   OriginalPaper Pages: 82 - 92

7. On the non-polynomiality of the relaxation method for systems of linear inequalities

   • J. L. Goffin

   OriginalPaper Pages: 93 - 103

8. Axiomatic approach to statistical models and their use in multimodal optimization theory

   • A. Žilinskas

   OriginalPaper Pages: 104 - 116

9. Boolean sublattices connected with minimization problems on matroids

   • Masataka Nakamura

   Short Communication Pages: 117 - 120

10. On the structure of all minimum cuts in a network and applications

    • Jean-Claude Picard
    • Maurice Queyranne

    Notice Pages: 121 - 121

11. XI. International Symposium on Mathematical Programming

    • Bernhard Korte

    Notice Pages: 122 - 123

12. A stochastic method for global optimization

    • C. G. E. Boender
    • A. H. G. Rinnooy Kan
    • L. Stougie

    OriginalPaper Pages: 125 - 140

13. Finite checkability for integer rounding properties in combinatorial programming problems

    • S. Baum
    • L. E. Trotter Jr.

    OriginalPaper Pages: 141 - 147

14. Heuristics for the fixed cost median problem

    • Dorit S. Hochbaum

    OriginalPaper Pages: 148 - 162

15. On the computational utility of posynomial geometric programming solution methods

    • J. E. Fattler
    • G. V. Reklaitis
    • K. M. Ragsdell

    OriginalPaper Pages: 163 - 201

16. A method of centers algorithm for certain minimax problems

    • Robin W. Chaney

    OriginalPaper Pages: 202 - 226

17. On minimax optimization problems

    • Zvi Drezner

    Short Communication Pages: 227 - 230

18. A polynomial algorithm for integer programming covering problems satisfying the integer round-up property

    • James B. Orlin

    Short Communication Pages: 231 - 235

19. Call for papers: 1982 Design Automation Conference

    Notice Pages: 236 - 237

20. Call for papers: Fourth Symposium on Mathematical Programming with Data Perturbations

    Notice Pages: 238 - 238

21. Convergence of a cyclic ellipsoid algorithm for systems of linear equalities

    • J. L. Goffin

    OriginalPaper Pages: 239 - 260

22. Evaluating computational efficiency: A stochastic approach

    • Regina Benveniste

    OriginalPaper Pages: 261 - 287

23. Partial pivoting strategies for symmetric gaussian elimination

    • Achiya Dax

    OriginalPaper Pages: 288 - 303

24. Polynomially bounded algorithms for locatingp-centers on a tree

    • R. Chandrasekaran
    • A. Tamir

    OriginalPaper Pages: 304 - 315

25. Decomposition algorithms for locating minimal cuts in a network

    • John J. Jarvis
    • Suleyman Tufekci

    OriginalPaper Pages: 316 - 331

26. Mixed-integer quadratic programming

    • Rafael Lazimy

    OriginalPaper Pages: 332 - 349

27. An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs

    • Daniel Granot
    • Frieda Granot
    • Willem Vaessen

    Short Communication Pages: 350 - 357