| 1 | -- | 13 | Shih-Ping Han. Variable metric methods for minimizing a class of nondifferentiable functions |
| 14 | -- | 21 | Dominique de Werra. On some characterisations of totally unimodular matrices |
| 22 | -- | 32 | Karla L. Hoffman. A method for globally minimizing concave functions over convex sets |
| 33 | -- | 48 | Gerard van der Laan, A. J. J. Talman. A class of simplicial restart fixed point algorithms without an extra dimension |
| 49 | -- | 62 | Jørgen Hald, Kaj Madsen. Combined lp and quasi-Newton methods for minimax optimization |
| 63 | -- | 80 | Darald J. Hartfiel, Guy L. Curry. On optimizing functions which are defined in part by an approximation process |
| 81 | -- | 102 | Jong-Shi Pang, Patrick S. C. Lee. A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model |
| 103 | -- | 109 | S. R. Mohan. 0-matrix |
| 110 | -- | 121 | Fern S. Sisser. Elimination of bounds in optimization problems by transforming variables |
| 129 | -- | 143 | Dennis F. Karney. Duality gaps in semi-infinite linear programming - an approximation problem |
| 144 | -- | 151 | M. J. D. Powell. A note on quasi-newton formulae for sparse second derivative matrices |
| 152 | -- | 165 | Jong-Shi Pang. An equivalence between two algorithms for quadratic programming |
| 166 | -- | 172 | Marc E. Posner, Chu-Tao Wu. Linear max-min programming |
| 173 | -- | 195 | Laurence A. Wolsey. Integer programming duality: Price functions and sensitivity analysis |
| 196 | -- | 212 | Andrzej Stachurski. Superlinear convergence of Broyden's bounded θ-class of methods |
| 213 | -- | 224 | Daniel Solow. Homeomorphisms of triangulations with applications to computing fixed points |
| 225 | -- | 232 | Wen-Lian Hsu, Yoshiro Ikura, George L. Nemhauser. A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles |
| 233 | -- | 244 | Heinz Gröflin, Thomas M. Liebling. Connected and alternating vectors: Polyhedra and algorithms |
| 245 | -- | 250 | James K. Ho, Etienne Loute. A set of staircase linear programming test problems |
| 255 | -- | 282 | Nicos Christofides, Aristide Mingozzi, Paolo Toth. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations |
| 283 | -- | 302 | Marguerite Frank. The Braess paradox |
| 303 | -- | 326 | James K. Ho, Etienne Loute. An advanced implementation of the Dantzig-Wolfe decomposition algorithm for linear programming |
| 327 | -- | 347 | Jacob Flachs. Global saddle-point duality for quasi-concave programs |
| 348 | -- | 352 | Jong-Shi Pang. Q-matrices |
| 353 | -- | 357 | M. J. D. Powell. An example of cycling in a feasible point algorithm |