default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 17
Volume 17, Number 1, 1979
- Robert G. Jeroslow:
Minimal inequalities. 1-15 - Ralph E. Steuer:
Goal programming sensitivity analysis using interval penalty weights. 16-31 - Philip E. Gill, Walter Murray:
The computation of Lagrange-multiplier estimates for constrained minimization. 32-60 - Elijah Polak, Russell E. Trahan, David Q. Mayne:
Combined phase I - phase II methods of feasible directions. 61-73 - Gerard van der Laan, A. J. J. Talman:
A restart algorithm for computing fixed points without an extra dimension. 74-84 - Oli B. G. Madsen:
Glass cutting in a small firm. 85-90 - William R. Pulleyblank:
Minimum node covers and 2-bicritical graphs. 91-103 - Ikuyo Kaneko:
The number of solutions of a class of linear complementarity problems. 104-105 - Michael J. Todd:
Piecewise linear paths to minimize convex functions may not be monotonic. 106-108 - John J. Dinkel, Gary A. Kochenberger:
Some remarks on condensation methods for geometric programs. 109-113 - Christakis Charalambous:
On conditions for optimality of the nonlinear l1 problem. 123-135 - Masakazu Kojima, Romesh Saigal:
On the number of solutions to a class of linear complementarity problems. 136-139 - S. Torkel Glad, Elijah Polak:
A multiplier method with automatic limitation of penalty growth. 140-155 - Ron S. Dembo:
Second order algorithms for the posynomial geometric programming dual, part I: Analysis. 156-175 - David E. Bell:
Efficient group cuts for integer programs. 176-183 - C. B. García, Floyd J. Gould:
Scalar labelings for homotopy paths. 184-197 - Monique Guignard, Kurt Spielberg:
A direct dual method for the mixed plant location problem with some side constraints. 198-228 - Alfred Auslender:
Penalty methods for computing points that satisfy second order necessary conditions. 229-238 - Clyde L. Monma, Leslie E. Trotter Jr.:
On perfect graphs and polyhedra with (0, 1)-valued extreme points. 239-242 - Jong-Shi Pang:
On Q-matrices. 243-247 - Shih-Ping Han, Olvi L. Mangasarian:
Exact penalty functions in nonlinear programming. 251-269 - Christakis Charalambous:
Acceleration of the least pth algorithm for minimax optimization with engineering applications. 270-297 - H. Mukai:
Readily implementable conjugate gradient methods. 298-319 - Mark H. Karwan
, Ronald L. Rardin:
Some relationships between lagrangian and surrogate duality in integer programming. 320-334 - Yahya Fathi:
Computational complexity of LCPs associated with positive definite symmetric matrices. 335-344 - Fred W. Glover, Darwin Klingman:
A o(n logn) algorithm for LP knapsacks with GUB constraints. 345-361 - Gabriel R. Bitran:
Theory and algorithms for linear multiple objective programs with zero-one variables. 362-390 - Michael Bastian:
Updated triangular factors of the working basis in winkler's decomposition approach. 391-397 - Alfred Lehman:
On the width - length inequality. 403-417
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-11 21:17 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:
