1. Improved approximation algorithms for capacitated facility location problems

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

   OriginalPaper 31 May 2004 Pages: 207 - 222

2. Differentiability and semismoothness properties of integral functions and their applications

   • Liqun Qi
   • Alexander Shapiro
   • Chen Ling

   OriginalPaper 31 May 2004 Pages: 223 - 248

3. A linear algorithm for integer programming in the plane

   • F. Eisenbrand
   • Sören Laue

   OriginalPaper 07 July 2004 Pages: 249 - 259

4. “Cone-free” primal-dual path-following and potential-reduction polynomial time interior-point methods

   • Arkadi Nemirovski
   • Levent Tunçel

   OriginalPaper 21 July 2004 Pages: 261 - 294

5. Lagrangian decomposition of block-separable mixed-integer all-quadratic programs

   • Ivo Nowak

   OriginalPaper 06 February 2004 Pages: 295 - 312

6. Locating tree-shaped facilities using the ordered median objective

   • J. Puerto
   • A. Tamir

   OriginalPaper 01 October 2004 Pages: 313 - 338

7. Coordinatewise domain scaling algorithm for M-convex function minimization

   • Akihisa Tamura

   OriginalPaper 31 May 2004 Pages: 339 - 354

8. Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs

   • Ramkumar Ramaswamy
   • James B. Orlin
   • Nilopal Chakravarti

   OriginalPaper 07 June 2004 Pages: 355 - 369

9. A branch and cut algorithm for hub location problems with single assignment

   • Martine Labbé
   • Hande Yaman
   • Eric Gourdin

   OriginalPaper 07 July 2004 Pages: 371 - 405