1 | -- | 5 | Michel L. Balinski, Philip Wolfe. The journal |
6 | -- | 25 | Michael Held, Richard M. Karp. The traveling-salesman problem and minimum spanning trees: Part II |
26 | -- | 57 | M. J. D. Powell. Recent advances in unconstrained optimization |
58 | -- | 67 | Louis J. Billera. n-person game theory |
68 | -- | 75 | B. Curtis Eaves. On the basic theorem of complementarity |
76 | -- | 94 | Michel Bénichou, Jean-Michel Gauthier, P. Girodet, Gerard Hentges, Gerard Ribière, O. Vincent. Experiments in mixed-integer linear programming |
95 | -- | 101 | Richard W. Cottle, Jacques A. Ferland. On pseudo-convex functions of nonnegative variables |
102 | -- | 112 | T. C. Hu. Some problems in discrete optimization |
113 | -- | 116 | T. B. Crabill, James P. Evans, Floyd J. Gould. An example of an ill-conditioned nlp problem |
117 | -- | 120 | Harold W. Kuhn. Publications |
127 | -- | 136 | Jack Edmonds. Matroids and the greedy algorithm |
137 | -- | 152 | Alex Orden. On the solution of linear equation/inequality systems |
153 | -- | 167 | T. D. Parsons, A. W. Tucker. Hybrid programs: Linear and least-distance |
168 | -- | 194 | Delbert Ray Fulkerson. Blocking and anti-blocking pairs of polyhedra |
195 | -- | 216 | Eli Hellerman, Dennis C. Rarick. Reinversion with the preassigned pivot procedure |
217 | -- | 238 | Garth P. McCormick. Penalty function versus non-penalty function methods for constrained nonlinear programming problems |
239 | -- | 266 | Bernard Roy. Problems and methods with multiple objective functions |
267 | -- | 269 | Eugene L. Lawler. A solvable case of the traveling salesman problem |
270 | -- | 273 | A. C. Williams. Notice |
275 | -- | 290 | Jean-Marie Pla. An "out-of-kilter" algorithm for solving minimum cost potential problems |
291 | -- | 300 | Abraham Berman, Adi Ben-Israel. Linear inequalities, mathematical programming and matrix theory |
301 | -- | 306 | D. J. Wilde, J. M. Sanchez-Anton. Discrete optimization on a multivariable boolean lattice |
307 | -- | 320 | Roland A. Minch. Applications of symmetric derivatives in mathematical programming |
321 | -- | 358 | Michael D. Grigoriadis. A projective method for structured nonlinear programs |
359 | -- | 365 | Antal Majthay. Optimality conditions for quadratic programming |
366 | -- | 375 | R. Benayoun, J. de Montgolfier, J. Tergny, O. Laritchev. Linear programming with multiple objective functions: Step method (stem) |