| 1 | -- | 16 | Stephen M. Robinson. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms |
| 17 | -- | 31 | Arie Tamir. Minimality and complementarity properties associated with Z-functions and M-functions |
| 32 | -- | 45 | Manfred W. Padberg, M. R. Rao. The travelling salesman problem and a class of polyhedra of diameter two |
| 46 | -- | 59 | Yves Smeers. A monotonic passy-like algorithm for the modular design problem |
| 60 | -- | 86 | Richard S. Barr, Fred Glover, Darwin Klingman. An improved version of the out-of-kilter method and a comparative study of computer codes |
| 87 | -- | 96 | Keld Helbig Hansen, Jakob Krarup. Improvements of the Held - Karp algorithm for the symmetric traveling-salesman problem |
| 97 | -- | 107 | Nimrod Megiddo. Optimal flows in networks with multiple sources and sinks |
| 117 | -- | 143 | Stanley J. Garstka, Roger J.-B. Wets. On decision rules in stochastic programming |
| 144 | -- | 161 | H. Massam, Sanjo Zlobec. Various definitions of the derivative in mathematical programming |
| 162 | -- | 180 | Jaromir Abrham, L. S. Luboobi. A numerical method for a class of continuous concave programming problems |
| 181 | -- | 190 | John J. Dinkel, Gary A. Kochenberger, Bruce McCarl. An approach to the numerical solutions of geometric programs |
| 191 | -- | 198 | Paul J. Schweitzer. Optimization with an approximate Lagrangian |
| 199 | -- | 211 | John Freidenfelds. A set intersection theorem and applications |
| 212 | -- | 222 | U. Pape. Implementation and efficiency of Moore-algorithms for the shortest route problem |
| 223 | -- | 235 | Robert R. Meyer. On the existence of optimal solutions to integer and mixed-integer programming problems |
| 236 | -- | 239 | David B. Weinberger. A note on the blocker of tours |
| 240 | -- | 244 | Harvey J. Greenberg, Dennis C. Rarick. Determining GUB sets via an invert agenda algorithm |
| 245 | -- | 248 | Alan M. Frieze. A cost function property for plant location problems |
| 249 | -- | 252 | Djangir A. Babayev. Comments on the note of Frieze |
| 253 | -- | 258 | Thomas L. Magnanti. Fenchel and Lagrange duality are equivalent |
| 263 | -- | 282 | Gordon H. Bradley, Peter L. Hammer, Laurence Wolsey. Coefficient reduction for inequalities in 0-1 variables |
| 283 | -- | 310 | Cornelis van de Panne. A complementary variant of Lemke's method for the linear complementary problem |
| 311 | -- | 350 | Philip E. Gill, Walter Murray. Newton-type methods for unconstrained and linearly constrained optimization |
| 351 | -- | 367 | Shmuel S. Oren. On the selection of parameters in Self Scaling Variable Metric Algorithms |
| 368 | -- | 375 | George J. Minty. A "from scratch" proof of a theorem of Rockafellar and Fulkerson |
| 376 | -- | 379 | Alan M. Frieze. A bilinear programming formulation of the 3-dimensional assignment problem |
| 380 | -- | 383 | Philip Wolfe. Note on a method of conjugate subgradients for minimizing nondifferentiable functions |
| 384 | -- | 387 | Claude Lemaréchal. Note on an extension of "Davidon" methods to nondifferentiable functions |