default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 23
Volume 23, Number 1, 1982
- Donald Goldfarb, Michael J. Todd:
Modifications and implementation of the ellipsoid algorithm for linear programming. 1-19 - Dianne P. O'Leary:
A discrete Newton algorithm for minimizing a function of many variables. 20-33 - Michael J. Todd:
An implementation of the simplex method for linear programming problems with variable upper bounds. 34-49 - Gérard Cornuéjols, Jean-Michel Thizy:
Some facets of the simple plant location polytope. 50-74 - Hiroshi Yamashita:
A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function. 75-86 - Dietmar Saupe:
On accelerating PL continuation algorithms by predictor - corrector methods. 87-110 - Mordechai I. Henig:
Existence and characterization of efficient decisions with respect to cones. 111-116 - Victor Griffin, Julián Aráoz, Jack Edmonds:
Polyhedral polarity defined by a general bilinear inequality. 117-137 - B. Curtis Eaves, Robert M. Freund:
Optimal scaling of balls and polyhedra. 138-147 - Thomas R. Elken:
Combining a path method and parametric linear programming for the computation of competitive equilibria. 148-169 - Andrew C. Ho:
Worst case analysis of a class of set covering heuristics. 170-180 - Robert D. Doverspike:
Some perturbation results for the Linear Complementarity Problem. 181-192 - Jean-Pierre Crouzeix, Jacques A. Ferland:
Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons. 193-205 - Katta G. Murty, Yahya Fathi:
A critical index algorithm for nearest point problems on simplicial cones. 206-215 - Manlio Gaudioso
, Maria Flavia Monaco:
A bundle type approach to the unconstrained minimization of convex nonsmooth functions. 216-226 - Rainer E. Burkard, Ulrich Fincke:
On random quadratic bottleneck assignment problems. 227-232 - Charles E. Blair, Robert G. Jeroslow:
The value function of an integer program. 237-273 - Robert Fourer:
Solving staircase linear programs by the simplex method, 1: Inversion. 274-313 - Richard J. Herman:
Dynamically restricted pricing in the simplex method for linear programming. 314-325 - Larry Nazareth, Jorge Nocedal:
Conjugate direction methods with variable storage. 326-340 - Tetsuo Ichimori, Hiroaki Ishii, Toshio Nishida:
Optimal sharing. 341-348 - Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright:
A note on a sufficient-decrease criterion for a non-derivative step-length procedure. 349-352 - Sunita Agarwal, Prabha Sharma, A. K. Mittal:
An extension of the edge covering problem. 353-356
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-10-04 20:03 CEST 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:
