| 1 | -- | 22 | B. Curtis Eaves. Homotopies for computation of fixed points |
| 23 | -- | 85 | Ralph E. Gomory, Ellis L. Johnson. Some continuous functions related to corner polyhedra |
| 86 | -- | 100 | Fred Glover. Cut search methods in integer programming |
| 101 | -- | 116 | Garth P. McCormick, Klaus Ritter. Methods of conjugate directions versus quasi-Newton methods |
| 117 | -- | 123 | Michel L. Balinski. A note on harmonious families |
| 131 | -- | 133 | Olvi L. Mangasarian. Publications |
| 135 | -- | 144 | Jean François Maurras. Optimization of the flow through networks with gains |
| 145 | -- | 156 | Stephen M. Robinson. A quadratically-convergent algorithm for general nonlinear programming problems |
| 157 | -- | 177 | Michael D. Grigoriadis, W. W. White. A partitioning algorithm for the multicommodity network flow problem |
| 178 | -- | 192 | Jacques A. Ferland. Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions |
| 193 | -- | 209 | Robert E. Kuenne, Richard M. Soland. Exact and approximate solutions to the multisource weber problem |
| 210 | -- | 224 | Richard W. Cottle. Monotone solutions of the parametric linear complementarity problem |
| 225 | -- | 237 | B. Curtis Eaves, Romesh Saigal. Homotopies for computation of fixed points on unbounded regions |
| 238 | -- | 249 | Richard W. Cottle, Arthur F. Veinott Jr.. Polyhedral sets having a least element |
| 250 | -- | 253 | Richard James Duffin, Elmor L. Peterson. The proximity of (algebraic) geometric programming to linear programming |
| 254 | -- | 256 | Jacob Ponstein. On the maximal flow problem with real arc capacities |
| 257 | -- | 258 | Michel L. Balinski, Andrew Russakoff. Some properties of the assignment polytope |
| 259 | -- | 0 | B. Mond. Book review |
| 263 | -- | 275 | Farrokh Neghabat, Robert M. Stark. A cofferdam design optimization |
| 276 | -- | 295 | Jean-Charles Fiorot. Generation of all integer points for given sets of linear inequalities |
| 296 | -- | 301 | Jacques A. Ferland. Mathematical programming problems with quasi-convex objective functions |
| 302 | -- | 311 | Werner Oettli. An iterative method, having linear rate of convergence, for solving a pair of dual linear programs |
| 312 | -- | 325 | Johan Philip. Plane sections of simplices |
| 326 | -- | 338 | Floyd J. Gould. Proximate linear programming: A variable extreme point method |
| 339 | -- | 344 | E. M. L. Beale, John A. Tomlin. An integer programming approach to a class of combinatorial problems |
| 345 | -- | 358 | L. C. W. Dixon. Quasi Newton techniques generate identical points II: The proofs of four new theorems |
| 359 | -- | 389 | Ralph E. Gomory, Ellis L. Johnson. Some continuous functions related to corner polyhedra, II |
| 390 | -- | 391 | Arie Tamir. On "an efficient algorithm for minimizing barrier and penalty functions" |
| 392 | -- | 394 | David F. Shanno. Book review |