Hipólito Hernández-Pérez
Orcid: 0000-0002-3255-6578
According to our database1,
Hipólito Hernández-Pérez
authored at least 15 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem.
Comput. Oper. Res., January, 2024
2022
A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem.
Eur. J. Oper. Res., 2022
2021
Comput. Oper. Res., 2021
2019
Proceedings of the Computational Logistics - 10th International Conference, 2019
2018
Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem.
Comput. Oper. Res., 2018
An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018
2016
A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem.
Eur. J. Oper. Res., 2016
2014
2013
Electron. Notes Discret. Math., 2013
2009
Eur. J. Oper. Res., 2009
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem.
Comput. Oper. Res., 2009
2007
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms.
Networks, 2007
2004
Transp. Sci., 2004
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery.
Discret. Appl. Math., 2004
2001
Proceedings of the Combinatorial Optimization, 2001