default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 1
Volume 1, Number 1, 1971
- Michel L. Balinski, Philip Wolfe:
The journal. 1-5 - Michael Held, Richard M. Karp:
The traveling-salesman problem and minimum spanning trees: Part II. 6-25 - M. J. D. Powell:
Recent advances in unconstrained optimization. 26-57 - Louis J. Billera:
Some recent results in n-person game theory. 58-67 - B. Curtis Eaves:
On the basic theorem of complementarity. 68-75 - Michel Bénichou, Jean-Michel Gauthier, Paul Girodet, Gerard Hentges, Gerard Ribière, O. Vincent:
Experiments in mixed-integer linear programming. 76-94 - Richard W. Cottle, Jacques A. Ferland:
On pseudo-convex functions of nonnegative variables. 95-101 - T. C. Hu:
Some problems in discrete optimization. 102-112 - T. B. Crabill, James P. Evans, Floyd J. Gould:
An example of an ill-conditioned nlp problem. 113-116 - Harold W. Kuhn:
Publications. 117-120 - Jack Edmonds:
Matroids and the greedy algorithm. 127-136 - Alex Orden:
On the solution of linear equation/inequality systems. 137-152 - Torrence D. Parsons, Albert W. Tucker:
Hybrid programs: Linear and least-distance. 153-167 - Delbert Ray Fulkerson:
Blocking and anti-blocking pairs of polyhedra. 168-194 - Eli Hellerman, Dennis C. Rarick:
Reinversion with the preassigned pivot procedure. 195-216 - Garth P. McCormick:
Penalty function versus non-penalty function methods for constrained nonlinear programming problems. 217-238 - Bernard Roy:
Problems and methods with multiple objective functions. 239-266 - Eugene L. Lawler:
A solvable case of the traveling salesman problem. 267-269 - A. C. Williams:
Notice. 270-273 - Jean-Marie Pla:
An "out-of-kilter" algorithm for solving minimum cost potential problems. 275-290 - Abraham Berman, Adi Ben-Israel:
Linear inequalities, mathematical programming and matrix theory. 291-300 - Douglass J. Wilde, J. M. Sanchez-Anton:
Discrete optimization on a multivariable boolean lattice. 301-306 - Roland A. Minch:
Applications of symmetric derivatives in mathematical programming. 307-320 - Michael D. Grigoriadis:
A projective method for structured nonlinear programs. 321-358 - Antal Majthay:
Optimality conditions for quadratic programming. 359-365 - R. Benayoun, J. de Montgolfier, J. Tergny, O. Laritchev:
Linear programming with multiple objective functions: Step method (stem). 366-375
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-20 23:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
