default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 10
Volume 10, Number 1, 1976
- Donald Goldfarb:
Matrix factorizations in optimization of nonlinear functions subject to linear constraints. 1-31 - Melanie L. Lenard:
Convergence conditions for restarted conjugate gradient methods with inaccurate line searches. 32-51 - E. M. L. Beale, John J. H. Forrest:
Global optimization using special ordered sets. 52-69 - Shmuel S. Oren, Emilio Spedicato:
Optimal conditioning of self-scaling variable Metric algorithms. 70-90 - Glenn W. Graves, Richard D. McBride:
The factorization approach to large-scale linear programming. 91-110 - Raymond A. Cuninghame-Green:
Projections in minimax algebra. 111-123 - L. C. Westphal:
An associated maximization problem for two-person nonzero-sum separable games. 124-133 - C. B. García:
A note on A complementary variant of Lemke's method. 134-136 - Garth P. McCormick:
Computability of global solutions to factorable nonconvex programs: Part I - Convex underestimating problems. 147-175 - C. Roger Glassey:
Explicit duality for convex homogeneous programs. 176-191 - Ron S. Dembo:
A set of geometric programming test problems and their solutions. 192-213 - Robert E. Stanford:
Analytical solution of A dynamic transaction flow problem. 214-229 - Günther F. Schrack, Mark Choit:
Optimized relative step size random searches. 230-244 - Carlton E. Lemke, Stephen J. Grotzinger:
On generalizing shapley's index theory to labelled pseudomanifolds. 245-262 - Olvi L. Mangasarian:
Linear complementarity problems solvable by A single linear program. 263-270 - Harold N. Gabow:
Decomposing symmetric exchanges in matroid bases. 271-276 - Vincent A. Sposito:
Quadratic duality over convex cone domains. 277-283 - Anthony V. Fiacco:
Sensitivity analysis for nonlinear programming using penalty methods. 287-311 - Reiner Horst:
An algorithm for nonconvex programming problems. 312-321 - Michael J. Todd:
On triangulations for computing fixed points. 322-346 - Arie Tamir:
On the number of solutions to the linear comple-mentarity problem. 347-353 - Sam L. Savage:
Some theoretical implications of local optimization. 354-366 - P. Miliotis:
Integer programming approaches to the travelling salesman problem. 367-378 - Ronald L. Rardin, V. E. Unger:
Some computationally relevant group theoretic structures of fixed charge problems. 379-400 - James R. Evans:
A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem. 401-404 - M. Sakarovitch:
Quasi balanced matrices - An addendum. 405-407
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-09 23:26 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:
