Hipólito Hernández Pérez-rekin lankidetzan egindako argitalpenak (19)

2024

  1. A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem

    Computers and Operations Research, Vol. 161

2022

  1. A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem

    European Journal of Operational Research, Vol. 297, Núm. 2, pp. 467-483

2021

  1. The single-vehicle two-echelon one-commodity pickup and delivery problem

    Computers and Operations Research, Vol. 127

2019

  1. Optimal solutions for the vehicle routing problem with split demands

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2018

  1. An exact algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem

    Computers and Operations Research, Vol. 97, pp. 1-17

2016

  1. A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem

    European Journal of Operational Research, Vol. 251, Núm. 1, pp. 44-52

2014

  1. The multi-commodity pickup-and-delivery traveling salesman problem

    Networks, Vol. 63, Núm. 1, pp. 46-59

2013

  1. A variable neighborhood search for the multi-commodity pickup-and-delivery TSP

    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

  2. International network optimization conference, Tenerife 2013

    Electronic Notes in Discrete Mathematics

2009

  1. A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem

    Computers and Operations Research, Vol. 36, Núm. 5, pp. 1639-1645

  2. The multi-commodity one-to-one pickup-and-delivery traveling salesman problem

    European Journal of Operational Research, Vol. 196, Núm. 3, pp. 987-995

2007

  1. The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms

    Networks, Vol. 50, Núm. 4, pp. 258-272

2004

  1. A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

    Discrete Applied Mathematics, Vol. 145, Núm. 1, pp. 126-139

  2. Heuristics for the one-commodity pickup-and-delivery traveling salesman problem

    Transportation Science, Vol. 38, Núm. 2, pp. 245-255

2003

  1. Nuevos algoritmos para rutas óptimas recogiendo y entregando varios productos

    27 Congreso Nacional de Estadística e Investigación Operativa [Archivo de ordenador]: Lleida, del 8 al 11 de abril de 2003. Actas

  2. The one-commodity pickup-and-delivery travelling salesman problem

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2570, pp. 89-104

2001

  1. Solvin travelling salesman problems with pickups and deliveries

    XXVI Congreso Nacional de Estadística e Investigación Operativa: Úbeda, 6-9 de noviembre de 2001

2000

  1. A pickup-and-delivery travelling salesman problem

    XXV Congreso Nacional de Estadística e Investigación Operativa: Vigo, 4-7 de abril de 2000