1. Optimal location and design of a competitive facility

   • Frank Plastria
   • Emilio Carrizosa

   OriginalPaper 30 September 2003 Pages: 247 - 265

2. The integration of an interior-point cutting plane method within a branch-and-price algorithm

   • Samir Elhedhli
   • Jean-Louis Goffin

   OriginalPaper 30 September 2003 Pages: 267 - 294

3. Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers

   • Van Anh Truong
   • Levent Tunçel

   OriginalPaper 01 September 2003 Pages: 295 - 316

4. A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with -iteration complexity

   • Florian A. Potra

   OriginalPaper 30 October 2003 Pages: 317 - 337

5. A note on linear complementarity problems and multiple objective programming

   • S.R. Mohan
   • S.K. Neogy
   • A.K. Das

   OriginalPaper 30 September 2003 Pages: 339 - 344

6. An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion

   • Eduardo Conde

   OriginalPaper 30 October 2003 Pages: 345 - 353

7. A finite branch-and-bound algorithm for two-stage stochastic integer programs

   • Shabbir Ahmed
   • Mohit Tawarmalani
   • Nikolaos V. Sahinidis

   OriginalPaper 30 October 2003 Pages: 355 - 377

8. A globally convergent primal-dual interior-point filter method for nonlinear programming

   • Michael Ulbrich
   • Stefan Ulbrich
   • Luís N. Vicente

   OriginalPaper 21 November 2003 Pages: 379 - 410

9. Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation

   • Fabián A. Chudak
   • Tim Roughgarden
   • David P. Williamson

   OriginalPaper 09 January 2004 Pages: 411 - 421

10. A new branch-and-cut algorithm for the capacitated vehicle routing problem

    • Jens Lysgaard
    • Adam N. Letchford
    • Richard W. Eglese

    OriginalPaper 21 November 2003 Pages: 423 - 445