Top (journal of operations research)

• 

  Año 1998, Vol. 6, Número 2

  • Seleccionado

    Location of rectilinear center trajectories

    José Miguel Díaz-Báñez , J.A. Mesa

    págs. 159-177

    
  • Seleccionado

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

    Emilio Carrizosa Priego , Frank Plastria

    págs. 179-194

    
  • Seleccionado

    A convergent approximation sheme for efficient sets of the multi-criteria Weber location problem

    Justo Puerto Albandoz , Francisco Ramón Fernández García

    págs. 195-204

    
  • Seleccionado

    Efficient solution methods for covering tree problems

    T.B. Boffey

    págs. 205-221

    
  • Seleccionado

    Location of paths on trees with minimal eccentricity and superior section

    Blas Pelegrín Pelegrín , José Fernández Hernández , Pascual Fernández

    págs. 223-246

    
  • Seleccionado

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

    Peter H. Peeters, Frank Plastria

    págs. 247-260

    
  • Seleccionado

    The many-to-many location-routing problem

    G. Nagy, S. Salhi

    págs. 261-275

    
  • Seleccionado

    Solving the plant location problem on a line by linear programming

    Jack Brimberg, Charles Revelle

    págs. 277-286

    
  • Seleccionado

    A methodology for modelling travel distances by Bias stimation

    Francisco A. Ortega, J.A. Mesa

    págs. 287-311

    
  • Seleccionado

    Maximin location: discretization not always works

    Emilio Carrizosa Priego , Eduardo Conde Pena, María Isabel Alonso Galipienso

    págs. 313-319