default search action
Mathematical Programming, Volume 7
Volume 7, Number 1, 1974
- Stephen M. Robinson:
Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms. 1-16 - Arie Tamir:
Minimality and complementarity properties associated with Z-functions and M-functions. 17-31 - Manfred W. Padberg, M. R. Rao:
The travelling salesman problem and a class of polyhedra of diameter two. 32-45 - Yves Smeers:
A monotonic passy-like algorithm for the modular design problem. 46-59 - Richard S. Barr, Fred W. Glover, Darwin Klingman:
An improved version of the out-of-kilter method and a comparative study of computer codes. 60-86 - Keld Helbig Hansen, Jakob Krarup:
Improvements of the Held - Karp algorithm for the symmetric traveling-salesman problem. 87-96 - Nimrod Megiddo:
Optimal flows in networks with multiple sources and sinks. 97-107 - Stanley J. Garstka, Roger J.-B. Wets:
On decision rules in stochastic programming. 117-143 - H. Massam, Sanjo Zlobec:
Various definitions of the derivative in mathematical programming. 144-161 - Jaromir Abrham, Livingstone S. Luboobi
:
A numerical method for a class of continuous concave programming problems. 162-180 - John J. Dinkel, Gary A. Kochenberger, Bruce McCarl:
An approach to the numerical solutions of geometric programs. 181-190 - Paul J. Schweitzer:
Optimization with an approximate Lagrangian. 191-198 - John Freidenfelds:
A set intersection theorem and applications. 199-211 - U. Pape:
Implementation and efficiency of Moore-algorithms for the shortest route problem. 212-222 - Robert R. Meyer:
On the existence of optimal solutions to integer and mixed-integer programming problems. 223-235 - David B. Weinberger:
A note on the blocker of tours. 236-239 - Harvey J. Greenberg, Dennis C. Rarick:
Determining GUB sets via an invert agenda algorithm. 240-244 - Alan M. Frieze:
A cost function property for plant location problems. 245-248 - Djangir A. Babayev:
Comments on the note of Frieze. 249-252 - Thomas L. Magnanti:
Fenchel and Lagrange duality are equivalent. 253-258 - Gordon H. Bradley, Peter L. Hammer, Laurence A. Wolsey:
Coefficient reduction for inequalities in 0-1 variables. 263-282 - Cornelis van de Panne:
A complementary variant of Lemke's method for the linear complementary problem. 283-310 - Philip E. Gill, Walter Murray:
Newton-type methods for unconstrained and linearly constrained optimization. 311-350 - Shmuel S. Oren:
On the selection of parameters in Self Scaling Variable Metric Algorithms. 351-367 - George J. Minty:
A "from scratch" proof of a theorem of Rockafellar and Fulkerson. 368-375 - Alan M. Frieze:
A bilinear programming formulation of the 3-dimensional assignment problem. 376-379 - Philip Wolfe:
Note on a method of conjugate subgradients for minimizing nondifferentiable functions. 380-383 - Claude Lemaréchal:
Note on an extension of "Davidon" methods to nondifferentiable functions. 384-387
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 2024-11-15 19:42 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: