1. Preface

   • Blas Pelegrín

   EditorialNotes Pages: v - v

2. Location of rectilinear center trajectories

   • J. M. Díaz-Báñez
   • J. A. Mesa

   OriginalPaper Pages: 159 - 177

3. Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints

   • Emilio Carrizosa
   • Frank Plastria

   OriginalPaper Pages: 179 - 194

4. A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem

   • Justo Puerto
   • R. Fernández

   OriginalPaper Pages: 195 - 204

5. Efficient solution methods for covering tree problems

   • T. B. Boffey

   OriginalPaper Pages: 205 - 221

6. Location of paths on trees with minimal eccentricity and superior section

   • Pascual Fernández
   • Blas Pelegrín
   • José Fernández

   OriginalPaper Pages: 223 - 246

7. Discretization results for the Huff and Pareto-Huff competitive location models on networks

   • Peter H. Peeters
   • Frank Plastria

   OriginalPaper Pages: 247 - 260

8. The many-to-many location-routing problem

   • G. Nagy
   • S. Salhi

   OriginalPaper Pages: 261 - 275

9. Solving the plant location problem on a line by linear programming

   • Jack Brimberg
   • Charles ReVelle

   OriginalPaper Pages: 277 - 286

10. A methodology for modelling travel distances by Bias estimation

    • Francisco A. Ortega
    • Juan A. Mesa

    OriginalPaper Pages: 287 - 311

11. Maximin location: Discretization not always works

    • Isabel Alonso
    • Emilio Carrizosa
    • Eduardo Conde

    OriginalPaper Pages: 313 - 319