default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 19
Volume 19, Number 1, 1980
- Richard W. Cottle:
The journal. 1-2 - Alex Orden:
A step toward probabilistic analysis of simplex method convergence. 3-13 - Hanif D. Sherali, C. M. Shetty:
A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts. 14-31 - Henry Wolkowicz:
Geometry of optimality conditions and constraint qualifications: The convex case. 32-60 - Israel Zang:
A smoothing-out technique for min - max optimization. 61-77 - Gerard van der Laan, A. J. J. Talman:
A new subdivision for computing fixed points with a homotopy algorithm. 78-91 - Layne T. Watson:
Computational experience with the Chow - Yorke algorithm. 92-101 - John P. Norback, James G. Morris:
Fitting hyperplanes by minimizing orthogonal deviations. 102-105 - Martin E. Dyer
, Les G. Proll:
Eliminating extraneous edges in Greenberg's algorithm. 106-110 - Gianfranco d'Atri:
A note on heuristics for the traveling salesman problem. 111-114 - Uriel G. Rothblum, Hans Schneider:
Characterizations of optimal scalings of matrices. 121-136 - Willy Gochet, Yves Smeers:
A modified reduced gradient method for a class of nondifferentiable problems. 137-154 - Paul H. Zipkin:
Bounds for aggregating nodes in network problems. 155-177 - Thomas F. Coleman, Andrew R. Conn:
Second-order conditions for an exact penalty function. 178-185 - Ronald D. Armstrong, David S. Kung:
A dual method for discrete Chebychev curve fitting. 186-199 - Olvi L. Mangasarian:
Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems. 200-212 - Katta G. Murty:
Computational complexity of parametric linear programming. 213-219 - Andrzej Ruszczynski:
Feasible direction methods for stochastic programming problems. 220-229 - M. C. Cheng:
New criteria for the simplex algorithm. 230-236 - Reiner Horst:
A note on the convergence of an algorithm for nonconvex programming problems. 237-238 - André F. Perold:
A degeneracy exploiting LU factorization for the simplex method. 239-254 - Martin E. Dyer:
Calculating surrogate constraints. 255-278 - Richard D. Wollmer:
Two stage linear programming under uncertainty with 0-1 integer first stage variables. 279-288 - Siegfried Schaible, Israel Zang:
On the convexifiability of pseudoconvex C2-functions. 289-299 - Jacques Gauvin:
Shadow prices in nonconvex mathematical programming. 300-312 - Peter S. Brooks:
Infinite retrogression in the Eaves - Saigal algorithm. 313-327 - Ludo van der Heyden:
A variable dimension algorithm for the linear complementarity problem. 328-346 - Richard W. Cottle:
Completely-Q matrices. 347-351 - Jean-Charles Pomerol:
About a minimax theorem of Matthies, Strang and Christiansen. 352-355
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-11-28 23:55 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:
