1. A relaxation method for reconstructing objects from noisy X-rays

   • G. T. Herman

   OriginalPaper Pages: 1 - 19

2. An efficient algorithm for minimumk-covers in weighted graphs

   • Lee J. White
   • Mark L. Gillenson

   OriginalPaper Pages: 20 - 42

3. Break minimization

   • Franz J. M. Salzborn

   OriginalPaper Pages: 43 - 53

4. Analysis of mathematical programming problems prior to applying the simplex algorithm

   • A. L. Brearley
   • G. Mitra
   • H. P. Williams

   OriginalPaper Pages: 54 - 83

5. New results on equivalent integer programming formulations

   • Fred Glover

   OriginalPaper Pages: 84 - 90

6. A branch and bound algorithm for the generalized assignment problem

   • G. Terry Ross
   • Richard M. Soland

   OriginalPaper Pages: 91 - 103

7. A new algorithm for the solution of multi-state dynamic programming problems

   • H. R. Howson
   • N. G. F. Sancho

   OriginalPaper Pages: 104 - 116

8. Referees 1974

   Notice Pages: 117 - 118

9. A.W. Tucker Chairman-Elect

   Notice Pages: 119 - 119

10. Notice

    OriginalPaper Pages: 120 - 120

11. Mathematical programming study 2

    Notice Pages: 121 - 122

12. Editorial policy

    Notice Pages: 123 - 123

13. The Mathematical Programming Society

    Notice Pages: 124 - 124

14. On interior and convexity conditions, development of dual problems and saddlepoint optimality criteria in abstract mathematical programming

    • David A. Pyne

    OriginalPaper Pages: 125 - 133

15. A central cutting plane algorithm for the convex programming problem

    • Jack Elzinga
    • Thomas G. Moore

    OriginalPaper Pages: 134 - 145

16. Facets of the knapsack polytope

    • Egon Balas

    OriginalPaper Pages: 146 - 164

17. Faces for a linear inequality in 0–1 variables

    • Laurence A. Wolsey

    OriginalPaper Pages: 165 - 178

18. Facet of regular 0–1 polytopes

    • P. L. Hammer
    • E. L. Johnson
    • U. N. Peled

    OriginalPaper Pages: 179 - 206

19. An alternate implementation of Goldfarb's minimization algorithm

    • A. Buckley

    OriginalPaper Pages: 207 - 231

20. Vertex packings: Structural properties and algorithms

    • G. L. Nemhauser
    • L. E. Trotter Jr.

    OriginalPaper Pages: 232 - 248

21. Editorial policy

    Notice Pages: 249 - 249

22. The Mathematical Programming Society

    Notice Pages: 250 - 250

23. Convergence bounds for nonlinear programming algorithms

    • Robert Mifflin

    OriginalPaper Pages: 251 - 271

24. Resolution of the 0–1 knapsack problem: Comparison of methods

    • D. Fayard
    • G. Plateau

    OriginalPaper Pages: 272 - 307

25. Optimization algorithms and point-to-set-maps

    • P. Huard

    OriginalPaper Pages: 308 - 331

26. The theorem of the alternative, the key-theorem, and the vector-maximum problem

    • R. Lehmann
    • W. Oettli

    OriginalPaper Pages: 332 - 344

27. Improved integer programming bounds using intersections of corner polyhedra

    • David E. Bell
    • Marshall L. Fisher

    OriginalPaper Pages: 345 - 368

28. Degeneracy in fixed cost transportation problems

    • J. H. Ahrens
    • G. Finke

    Short Communication Pages: 369 - 374

29. Finding efficient points for linear multiple objective programs

    • J. G. Ecker
    • I. A. Kouada

    Short Communication Pages: 375 - 377

30. Partial linear characterizations of the asymmetric travelling salesman polytope

    • Martin Grötschel
    • Manfred W. Padberg

    Short Communication Pages: 378 - 381

31. Quasi-balanced matrices

    • M. Sakarovitch

    Short Communication Pages: 382 - 386

32. Announcements

    • M. L. Balinski

    Announcement Pages: 387 - 389

33. Editorial policy

    Notice Pages: 390 - 390

34. The Mathematical Programming Society

    Notice Pages: 391 - 391