Publicaciones en las que colabora con Alfredo Marín Pérez (21)

2023

  1. A new formulation and branch-and-cut method for single-allocation hub location problems

    Computers and Operations Research, Vol. 155

  2. The p-median problem with upgrading of transportation costs and minimum travel time allocation

    Computers and Operations Research, Vol. 159

2022

  1. A further study of single allocation hub location problem

    XXVII EURO Working Group on Locational Analysis

  2. New formulations for single allocation hubs location problems

    XXXIX CONGRESO NACIONAL DE ESTADÍSTICA E INVESTIGACIÓN OPERATIVA XIII JORNADAS DE ESTADÍSTICA PÚBLICA

  3. The soft-margin Support Vector Machine with ordered weighted average

    Knowledge-Based Systems, Vol. 237

  4. Upgrading edges in the maximal covering location problem

    European Journal of Operational Research, Vol. 303, Núm. 1, pp. 14-36

2020

  1. Upgraded network p-median problem

    X Workshop on Locational Analysis and Related Problems

2019

  1. A general covering location model including time-dependent and stochastic features

    Journées de l'Optimisation

  2. Reformulated acyclic partitioning for rail-rail containers transshipment

    European Journal of Operational Research, Vol. 277, Núm. 1, pp. 153-165

  3. Upgrading the Maximal Covering Location Problem

    EUROWorking Group on Locational Analysis Meeting EWGLA XXV

2018

  1. Multi-period stochastic covering location problems: Modeling framework and solution approach

    European Journal of Operational Research, Vol. 268, Núm. 2, pp. 432-449

2017

  1. Lexicographical Order in Integer Programming

    Vietnam Journal of Mathematics, Vol. 45, Núm. 3, pp. 459-476

2015

  1. Capacitated p-center problem with failure foresight

    European Journal of Operational Research, Vol. 247, Núm. 1, pp. 229-244

2013

  1. New results on robust location of emergency centers with failure foresight

    XXXIV Congreso Nacional de Estadística e Investigación Operativa, VIII Jornadas de Estadística Pública: SEIO 2013. Universitat Jaume I, Castellón, septiembre 2013. Libro de actas

2012

  1. Closest assignment constraints in discrete location problems

    European Journal of Operational Research, Vol. 219, Núm. 1, pp. 49-58

2010

  1. Lagrangean bounds for the optimum communication spanning tree problem

    Top, Vol. 18, Núm. 1, pp. 140-157

  2. The Tree of Hubs Location Problem

    European Journal of Operational Research, Vol. 202, Núm. 2, pp. 390-400

2009

  1. A comparison of formulations and solution methods for the minimum-envy location problem

    Computers and Operations Research, Vol. 36, Núm. 6, pp. 1966-1981

  2. Tight bounds from a path based formulation for the tree of hub location problem

    Computers and Operations Research, Vol. 36, Núm. 12, pp. 3117-3127

2008

  1. New trends in locational analysis

    Computers and Operations Research