default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 12
Volume 12, Number 1, 1977
- Richard Grinold:
Finite horizon approximations of infinite horizon linear programs. 1-17 - Gery Daeninck, Yves Smeers:
Using shortest paths in some transshipment problems with concave costs. 18-25 - Jean-Michel Gauthier, Gerard Ribière:
Experiments in mixed-integer linear programming using pseudo-costs. 26-47 - Ikuyo Kaneko:
Isotone solutions of parametric linear complementarity problems. 48-59 - Nimrod Megiddo:
On monotonicity in parametric linear complementarity problems. 60-66 - Mike C. Bartholomew-Biggs:
The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals. 67-80 - Martin E. Dyer
, Les G. Proll:
An algorithm for determining all extreme points of a convex polytope. 81-96 - Jean-Claude Picard, Maurice Queyranne:
On the integer-valued variables in the linear vertex packing problem. 97-101 - Fred W. Glover:
Compact LP bases for a class of IP problems. 102-109 - Nimrod Megiddo, Masakazu Kojima:
On the existence and uniqueness of solutions in nonlinear complementarity theory. 110-130 - Nimrod Megiddo:
A monotone complementarity problem with feasible solutions but no complementary solutions. 131-132 - Antonio Guccione, Noriyoshi Oguchi:
A note on the necessary conditions for exact aggregation of linear programming models. 133-135 - Jacques Gauvin:
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming. 136-138 - J. E. Gentle, Vincent A. Sposito, William J. Kennedy:
On some properties of L1 estimators. 139-140 - M. J. D. Powell:
Quadratic termination properties of Davidon's new variable metric algorithm. 141-147 - Freerk A. Lootsma, Harvey J. Greenberg:
Design and implementation of optimization software - International Summer School Organized by the Working Committee on Algorithms of the Mathematical Programming Society Sponsored by the Scientific Affairs Division of the North Atlantic Treaty Organization. 149-150 - Larry Nazareth:
A family of variable metric updates. 157-172 - Giorgio Gallo, Aydin Ülkücü:
Bilinear programming: An exact algorithm. 173-194 - Christakis Charalambous:
Nonlinear least pth optimization and nonlinear programming. 195-225 - Bezalel Gavish, Paul J. Schweitzer, Eliezer Shlifer:
The zero pivot phenomenon in transportation and assignment problems and its computational implications. 226-240 - M. J. D. Powell:
Restart procedures for the conjugate gradient method. 241-254 - Leslie E. Trotter Jr.:
Line perfect graphs. 255-259 - T. D. Lin, Richard S. H. Mah:
Hierarchical partition - a new optimal pivoting algorithm. 260-278 - Donald Goldfarb:
Matrix factorizations in optimization of nonlinear functions subject to linear constraints - an addendum. 279-280 - J. D. Buys, R. Gonin:
The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming. 281-284 - Mathilde Benveniste:
Testing for complete efficiency in a vector maximization problem. 285-288 - D. G. Mahajan, M. N. Vartak:
Generalization of some duality theorems in nonlinear programming. 293-317 - Rainer E. Burkard, Willi Hahn, Uwe Zimmermann:
An algebraic approach to assignment problems. 318-327 - Abraham Charnes, C. B. García, Carlton E. Lemke:
Constructive proofs of theorems relating to: F(x) = y, with applications. 328-343 - Kenneth W. Brodlie:
An assessment of two approaches to variable metric methods. 344-355 - J. R. Thompson:
Examples of non-convergence of conjugate descent algorithms with exact line-searches. 356-360 - Donald Goldfarb, John K. Reid:
A practicable steepest-edge simplex algorithm. 361-371 - V. Srinivasan, Gerald L. Thompson:
Cost operator algorithms for the transportation problem. 372-391 - Elmor L. Peterson:
The complementary unboundedness of dual feasible solution sets in convex programming. 392-405 - Richard E. Wendell, D. N. Lee:
Efficiency in multiple objective optimization problems. 406-414
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-01-21 20:18 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:
