default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 20
Volume 20, Number 1, 1981
- Shih-Ping Han:
Variable metric methods for minimizing a class of nondifferentiable functions. 1-13 - Dominique de Werra:
On some characterisations of totally unimodular matrices. 14-21 - Karla L. Hoffman:
A method for globally minimizing concave functions over convex sets. 22-32 - Gerard van der Laan, A. J. J. Talman:
A class of simplicial restart fixed point algorithms without an extra dimension. 33-48 - Jørgen Hald, Kaj Madsen:
Combined lp and quasi-Newton methods for minimax optimization. 49-62 - Darald J. Hartfiel, Guy L. Curry:
On optimizing functions which are defined in part by an approximation process. 63-80 - Jong-Shi Pang, Patrick S. C. Lee:
A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model. 81-102 - S. R. Mohan:
Degenerate complementary cones induced by a K0-matrix. 103-109 - Fern S. Sisser:
Elimination of bounds in optimization problems by transforming variables. 110-121 - Dennis F. Karney:
Duality gaps in semi-infinite linear programming - an approximation problem. 129-143 - M. J. D. Powell:
A note on quasi-newton formulae for sparse second derivative matrices. 144-151 - Jong-Shi Pang:
An equivalence between two algorithms for quadratic programming. 152-165 - Marc E. Posner, Chu-Tao Wu:
Linear max-min programming. 166-172 - Laurence A. Wolsey:
Integer programming duality: Price functions and sensitivity analysis. 173-195 - Andrzej Stachurski
:
Superlinear convergence of Broyden's bounded θ-class of methods. 196-212 - Daniel Solow:
Homeomorphisms of triangulations with applications to computing fixed points. 213-224 - Wen-Lian Hsu, Yoshiro Ikura, George L. Nemhauser:
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles. 225-232 - Heinz Gröflin, Thomas M. Liebling:
Connected and alternating vectors: Polyhedra and algorithms. 233-244 - James K. Ho, Etienne Loute:
A set of staircase linear programming test problems. 245-250 - Nicos Christofides, Aristide Mingozzi, Paolo Toth:
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. 255-282 - Marguerite Frank:
The Braess paradox. 283-302 - James K. Ho, Etienne Loute:
An advanced implementation of the Dantzig-Wolfe decomposition algorithm for linear programming. 303-326 - Jacob Flachs:
Global saddle-point duality for quasi-concave programs. 327-347 - Jong-Shi Pang:
A unification of two classes of Q-matrices. 348-352 - M. J. D. Powell:
An example of cycling in a feasible point algorithm. 353-357
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-04 22:09 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:
