Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 16
Volume 16, Number 1, 1979
- Jorge J. Moré, Danny C. Sorensen:
On the use of directions of negative curvature in a modified newton method. 1-20 - Willem K. Klein Haneveld, C. L. J. van der Meer, R. J. Peters:
A construction method in parametric programming. 21-36 - Masakazu Kojima, Hisakazu Nishino, Naohiko Arima:
A PL homotopy for finding all the roots of a polynomial. 37-62 - Regina Benveniste:
A quadratic programming algorithm using conjugate search directions. 63-80 - Melanie L. Lenard:
A computational study of active set strategies in nonlinear programming with linear constraints. 81-97 - Helmut Maurer, Jochem Zowe:
First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems. 98-110 - Jong-Shi Pang:
On a class of least-element complementarity problems. 111-126 - Michael M. Kostreva:
Cycling in linear complementarity problems. 127-130 - Call for papers: Symposium on Mathematical Programming with Data Perturbations - May 24-25, 1979 at The George Washington University, Washington, DC, U.S.A. 137-138
- Robert Mifflin:
A stable method for solving certain constrained least squares problems. 141-158 - C. B. García, Willard I. Zangwill:
Finding all solutions to polynomial systems and other systems of equations. 159-176 - J. Randall Brown:
Preventing redundant solutions in partial enumeration algorithms. 177-189 - George B. Dantzig, B. Curtis Eaves, David Gale:
An algorithm for a piecewise linear model of trade and production with negative prices and bankruptcy. 190-209 - Hoang Tuy:
Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm. 210-227 - Eric V. Denardo, Uriel G. Rothblum:
Optimal stopping, exponential utility, and linear programming. 228-244 - Alfred Lehman:
On the width-length inequality. 245-259 - Martin Grötschel, Manfred Padberg:
On the symmetric travelling salesman problem I: Inequalities. 265-280 - Martin Grötschel, Manfred Padberg:
On the symmetric travelling salesman problem II: Lifting theorems and facets. 281-302 - David Q. Mayne, N. Maratos:
A first order, exact penalty function algorithm for equality constrained optimization problems. 303-324 - Jong-Shi Pang, Ikuyo Kaneko, Wayne P. Hallman:
On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation. 325-347 - J. Flachs, Moshe Asher Pollatschek:
Duality theorems for certain programs involving minimum or maximum operations. 348-370 - Michael Epelman:
On a property of polyhedral sets. 371-373 - Muhamed Aganagic, Richard W. Cottle:
A note on Q-matrices. 374-377 - R. M. Chamberlain:
Some examples of cycling in variable metric methods for constrained minimization. 378-383 - Wayne P. Hallman, Ikuyo Kaneko:
On the connectedness of the set of almost complementary paths of a linear complementarity problem. 384-385
a service of 
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-05-10 19:50 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:
