Volume 53, 1992
- James Renegar, Michael Shub:
Unified complexity analysis for Newton LP methods.
1-16
- Thomas F. Coleman, Peter A. Fenyes:
Partitioned quasi-Newton methods for nonlinear equality constrained optimization.
17-44
- D. Burton, Philippe L. Toint:
On an instance of the inverse shortest paths problem.
45-61
- Franz Rendl, Henry Wolkowicz:
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem.
63-78
- H. Edwin Romeijn, Robert L. Smith, James C. Bean:
Duality in infinite dimensional linear programming.
79-97
- Masao Fukushima:
Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems.
99-110
- Van Hien Nguyen, Jean-Jacques Strodiot:
Computing a global optimal solution to a design centering problem.
111-123
- J. Michael Steele:
Euclidean semi-matchings of random samples.
127-146
- Jean Fonlupt, Denis Naddef:
The traveling salesman problem in graphs with some excluded minors.
147-172
- Matteo Fischetti, Paolo Toth:
An additive bounding procedure for the asymmetric travelling salesman problem.
173-197
- Jos A. M. Potters, Imma J. Curiel, Stef Tijs:
Traveling salesman games.
199-211
- Robert Fourer:
A simplex algorithm for piecewise-linear programming III: Computational analysis and applications.
213-235
- S. R. Mohan, R. Sridhar:
A note on a characterization of P-matrices.
237-242
- Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin, Robert Endre Tarjan:
Finding minimum-cost flows by double scaling.
243-266
- Constantin Zalinescu:
A note on d-stability of convex programs and limiting Lagrangians.
267-277
- Berç Rustem:
A constrained min-max algorithm for rival models of the same economic system.
279-295
- Paul Tseng:
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function.
297-306
- B. Curtis Eaves, Uriel G. Rothblum:
Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields.
307-321
- Zelda B. Zabinsky, Robert L. Smith:
Pure adaptive search in global optimization.
323-338
- Phan Thien Thach:
A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure.
339-359
- Takeshi Naitoh, Satoru Fujishige:
A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions.
361-363
Last update Wed May 22 18:06:34 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
