default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 32
Volume 32, Number 1, May 1985
- James B. Orlin
, Uriel G. Rothblum:
Computing optimal scalings by parametric network algorithms. 1-10 - Gerald G. Brown, Richard D. McBride, R. Kevin Wood:
Extracting embedded generalized networks from linear programming problems. 11-31 - Olvi L. Mangasarian, L. McLinden:
Simple bounds for solutions of monotone complementarity problems and convex programs. 32-40 - D. Le:
A fast and robust unconstrained optimization method requiring minimum storage. 41-68 - Robert S. Womersley:
Local properties of algorithms for minimizing nonsmooth composite functions. 69-89 - Nicholas I. M. Gould:
On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem. 90-99 - Rafael Lazimy:
Improved algorithm for mixed-integer quadratic programs and a computational study. 100-113 - Bernd Jeromin, Frank Körner:
On the refinement of bounds of heuristic algorithms for the traveling salesman problem. 114-117
Volume 32, Number 2, June 1985
- Kenneth J. Arrow, George B. Dantzig, Alan Manne:
In memory of Tjalling C. Koopmans. 123 - Dimitri P. Bertsekas:
A unified framework for primal-dual methods in minimum cost network flow problems. 125-145 - Robert G. Jeroslow:
The polynomial hierarchy and a simple model for competitive analysis. 146-164 - Uwe H. Suhl:
Solving large-scale mixed-integer programs with fixed charge variables. 165-182 - Alexander V. Karzanov:
Metrics and undirected cuts. 183-198 - Jonathan E. Spingarn:
Applications of the method of partial inverses to convex programming: Decomposition. 199-223 - Ya-Xiang Yuan:
An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations. 224-231 - Richard H. Byrd:
An example of irregular convergence in some constrained optimization methods that use the projected hessian. 232-237 - George Morton, Rabe von Randow, Karl Ringwald:
A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory. 238-241 - Jerzy Kyparisis:
On uniqueness of Kuhn-Tucker multipliers in nonlinear programming. 242-246
Volume 32, Number 3, July 1985
- Tom M. Cavalier, Hanif D. Sherali:
Sequential location-allocation problems on chains and trees with probabilistic link demands. 249-277 - Ury Passy, Eliezer Z. Prisman:
A convex-like duality scheme for quasi-convex programs. 278-300 - James Renegar:
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials. 301-318 - James Renegar:
On the cost of approximating all roots of a complex polynomial. 319-336 - Ian D. Coope, G. Alistair Watson:
A projected lagrangian algorithm for semi-infinite programming. 337-356 - Uriel G. Rothblum:
Ratios of affine functions. 357-365 - Richard Engelbrecht-Wiggans, Daniel Granot:
On market prices in linear production games. 366-370
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-05 21:05 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:
