Volume 100,
Number 1,
May 2004
Volume 100,
Number 2,
June 2004
- Frank Plastria, Emilio Carrizosa:
Optimal location and design of a competitive facility.
247-265
Electronic Edition (link) BibTeX
- Samir Elhedhli, Jean-Louis Goffin:
The integration of an interior-point cutting plane method within a branch-and-price algorithm.
267-294
Electronic Edition (link) BibTeX
- Van Anh Truong, Levent Tunçel:
Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers.
295-316
Electronic Edition (link) BibTeX
- Florian A. Potra:
A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with -iteration complexity.
317-337
Electronic Edition (link) BibTeX
- S. R. Mohan, S. K. Neogy, A. K. Das:
A note on linear complementarity problems and multiple objective programming.
339-344
Electronic Edition (link) BibTeX
- Eduardo Conde:
An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion.
345-353
Electronic Edition (link) BibTeX
- Shabbir Ahmed, Mohit Tawarmalani, Nikolaos V. Sahinidis:
A finite branch-and-bound algorithm for two-stage stochastic integer programs.
355-377
Electronic Edition (link) BibTeX
- Michael Ulbrich, Stefan Ulbrich, Luís N. Vicente:
A globally convergent primal-dual interior-point filter method for nonlinear programming.
379-410
Electronic Edition (link) BibTeX
- Fabián A. Chudak, Tim Roughgarden, David P. Williamson:
Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation.
411-421
Electronic Edition (link) BibTeX
- Jens Lysgaard, Adam N. Letchford, Richard W. Eglese:
A new branch-and-cut algorithm for the capacitated vehicle routing problem.
423-445
Electronic Edition (link) BibTeX
Volume 100,
Number 3,
July 2004
Copyright © Sun May 17 00:14:05 2009
by Michael Ley (ley@uni-trier.de)
