| 1 | -- | 13 | Richard S. Barr, Fred Glover, Darwin Klingman. The alternating basis algorithm for assignment problems |
| 14 | -- | 22 | A. A. Goldstein. Optimization of lipschitz continuous functions |
| 23 | -- | 37 | Arthur M. Geoffrion. Objective function approximations in mathematical programming |
| 38 | -- | 48 | C. C. Agunwamba. Optimality condition: Constraint regularization |
| 49 | -- | 68 | Balder Von Hohenbalken. Simplicial decomposition in nonlinear programming algorithms |
| 69 | -- | 80 | Manuel J. Carrillo. A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron |
| 81 | -- | 87 | Arie Tamir. Ergodicity and symmetric mathematical programs |
| 88 | -- | 93 | Darald J. Hartfiel, Guy L. Curry. On optimizing certain nonlinear convex functions which are partially defined by a simulation process |
| 94 | -- | 110 | Donald Goldfarb. Generating conjugate directions without line searches using factorized variable metric updating formulas |
| 111 | -- | 115 | Garth P. McCormick. A modification of Armijo's step-size rule for negative curvature |
| 116 | -- | 118 | Delbert Ray Fulkerson, Gary C. Harding. Maximizing the minimum source-sink path subject to a budget constraint |
| 121 | -- | 139 | Gabriel R. Bitran. Linear multiple objective programs with zero-one variables |
| 140 | -- | 155 | S. R. K. Dutta, Mathukumalli Vidyasagar. New algorithms for constrained minimax optimization |
| 156 | -- | 166 | M. Raghavachari. A geometric programming approach to the Van der Waerden conjecture on doubly stochastic matrices |
| 167 | -- | 182 | M. C. Biggs, M. A. Laughton. Optimal electric power scheduling: A large nonlinear programming test problem solved by recursive quadratic programming |
| 183 | -- | 199 | Jonathan M. Borwein. Multivalued convexity and optimization: A unified approach to inequality and equality constraints |
| 200 | -- | 220 | John J. Dinkel, William H. Elliott, Gary A. Kochenberger. Computational aspects of cutting-plane algorithms for geometric programming problems |
| 221 | -- | 237 | Mokhtar S. Bazaraa, Jamie J. Goode. The traveling salesman problem: A duality approach |
| 241 | -- | 254 | Johannes Bisschop, Alexander Meeraus. Matrix augmentation and partitioning in the updating of the basis inverse |
| 255 | -- | 271 | Hiroaki Ishii, Toshihide Ibaraki, Hisashi Mine. Fractional knapsack problems |
| 272 | -- | 279 | Donald Goldfarb. On the Bartels - Golub decomposition for linear programming bases |
| 280 | -- | 322 | Michel Bénichou, Jean-Michel Gauthier, Gerard Hentges, Gerard Ribière. The efficient solution of large-scale linear programming problems - some algorithmic techniques and computational results |
| 323 | -- | 328 | James R. Evans, John J. Jarvis, Richard A. Duke. Graphic matroids and the multicommodity transportation problem |
| 329 | -- | 347 | Jean-Louis Goffin. On convergence rates of subgradient optimization methods |
| 348 | -- | 356 | Markku Kallio, Evan L. Porteus. Decomposition of arborescent linear programs |
| 357 | -- | 359 | Johan Philip. Vector maximization at a degenerate vertex |
| 360 | -- | 363 | Jong-Shi Pang. A note on an open problem in linear complementarity |
| 364 | -- | 365 | Jean-Pierre Crouzeix. A relationship between the second derivatives of a convex function and of its conjugate |
| 366 | -- | 0 | Philip Wolfe. From the Secretariat of the Mathematical Programming Society |