Journal: Math. Program.

Volume 1, Issue 1

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