Argitalpenak (39) ENRIQUE BENAVENT LOPEZ argitalpenak

2023

  1. A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs

    European Journal of Operational Research, Vol. 307, Núm. 1, pp. 64-81

2019

  1. The Steiner Traveling Salesman Problem and its extensions

    European Journal of Operational Research, Vol. 278, Núm. 2, pp. 615-628

  2. The periodic rural postman problem with irregular services on mixed graphs

    European Journal of Operational Research, Vol. 276, Núm. 3, pp. 826-839

  3. The probabilistic pickup-and-delivery travelling salesman problem

    Expert Systems with Applications, Vol. 121, pp. 313-323

2016

  1. A branch-and-cut algorithm for the single truck and trailer routing problem with satellite depots

    Transportation Science, Vol. 50, Núm. 2, pp. 735-749

  2. Optimizing the level of service quality of a bike-sharing system

    Omega (United Kingdom), Vol. 62, pp. 163-175

2015

  1. Profitable mixed capacitated arc routing and related problems

    Top, Vol. 23, Núm. 1, pp. 244-274

  2. The multiple vehicle pickup and delivery problem with LIFO constraints

    European Journal of Operational Research, Vol. 243, Núm. 3, pp. 752-762

2014

  1. A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem

    Networks, Vol. 63, Núm. 1, pp. 34-45

  2. Arc Routing Problems with Min-Max Objectives

    ARC ROUTING: PROBLEMS, METHODS, AND APPLICATIONS (SIAM), pp. 255-280

  3. The Capacitated Arc Routing Problem: Exact Algorithms

    ARC ROUTING: PROBLEMS, METHODS, AND APPLICATIONS (SIAM), pp. 183-221

2013

  1. Multi-depot Multiple TSP: A polyhedral study and computational results

    Annals of Operations Research, Vol. 207, Núm. 1, pp. 7-25

2011

  1. A Branch-and-Cut method for the Capacitated Location-Routing Problem

    Computers and Operations Research, Vol. 38, Núm. 6, pp. 931-941

  2. New facets and an enhanced branch-and-cut for the min-max K-vehicles windy rural postman problem

    Networks

2010

  1. A metaheuristic for the min-max windy rural postman problem with K vehicles

    Computational Management Science, Vol. 7, Núm. 3, pp. 269-287

  2. Split-delivery capacitated arc-routing problem: Lower bound and metaheuristic

    Transportation Science, Vol. 44, Núm. 2, pp. 206-220

2009

  1. Estudio poliédrico del Problema del Viajante Múltiple con Varios Depósitos

    XXXI Congreso Nacional de Estadística e Investigación Operativa ; V Jornadas de Estadística Pública: Murcia, 10-13 de febrero de 2009 : Libro de Actas

  2. Min-Max K-vehicles windy rural postman problem

    Networks, Vol. 54, Núm. 4, pp. 216-226

  3. Soluciones posibles para el Min-Max K-WRPP

    XXXI Congreso Nacional de Estadística e Investigación Operativa ; V Jornadas de Estadística Pública: Murcia, 10-13 de febrero de 2009 : Libro de Actas

2007

  1. Lower bounds and heuristics for the Windy Rural Postman Problem

    European Journal of Operational Research, Vol. 176, Núm. 2, pp. 855-869