Volume 83,
1998
- Manuel A. Nunez, Robert M. Freund:
Condition measures and properties of the central trajectory of a linear program.
1-28 BibTeX
- Spyridon Kontogiorgis, Robert R. Meyer:
A variable-penalty alternating directions method for convex optimization.
29-53 BibTeX
- Christian Kanzow, Masao Fukushima:
Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities.
55-87 BibTeX
- R. Baker Kearfott:
On proving existence of feasible points in equality constrained optimization problems.
89-100 BibTeX
- Francisco Barahona, David Jensen:
Plant location with minimum inventory.
101-111 BibTeX
- Jonathan Eckstein:
Approximate iterations in Bregman-function-based proximal algorithms.
113-123 BibTeX
- Jacek Gondzio:
Warm start of the primal-dual method applied in the cutting-plane scheme.
125-143 BibTeX
- Hubertus Th. Jongen, Jan-J. Rückmann, Oliver Stein:
Generalized semi-infinite optimization: A first order optimality condition and examples.
145-158 BibTeX
- Paul Tseng:
Merit functions for semi-definite complementarity problems.
159-185 BibTeX
- Olvi L. Mangasarian:
Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification.
187-194 BibTeX
- Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler:
The nucleon of cooperative games and an algorithm for matching games.
195-211 BibTeX
- Lap Mui Ann Chan, David Simchi-Levi, Julien Bramel:
Worst-case analyses, linear programming and the bin-packing problem.
213-227 BibTeX
- Rüdiger Schultz, Leen Stougie, Maarten H. van der Vlerk:
Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions.
229-252 BibTeX
- B. Curtis Eaves, Karl H. Schmedders:
A cellation of the Grassmann manifold.
253-262 BibTeX
- Sien Deng:
Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems.
263-276 BibTeX
- Emilio Carrizosa, M. Muñoz-Márquez, Justo Puerto:
Location and shape of a rectangular facility in Realn Convexity properties.
277-290 BibTeX
- J. H. Reijnierse, Jos A. M. Potters:
On finding an envy-free Pareto-optimal division.
291-311 BibTeX
- Kazuo Murota:
Discrete convex analysis.
313-371 BibTeX
- Ladislav Luksan, Jan Vlcek:
A bundle-Newton method for nonsmooth unconstrained minimization.
373-391 BibTeX
- Masakazu Muramatsu:
Affine scaling algorithm fails for semidefinite programming.
393-406 BibTeX
- Josef Stoer, Martin Wechs:
Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity.
407-423 BibTeX
- Vladimir I. Norkin, Georg Ch. Pflug, Andrezj Ruszczynski:
A branch and bound method for stochastic global optimization.
425-450 BibTeX
- Claus C. Carøe, Jørgen Tind:
L-shaped decomposition of two-stage stochastic programs with integer recourse.
451-464 BibTeX
Copyright © Sun May 17 00:14:05 2009
by Michael Ley (ley@uni-trier.de)
