Jorge Riera-Ledesma

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 4

Top Topics

Mixed Integer Programming

Exact Algorithms

Routing Problem

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Electron. Notes Discret. Math.

Publications

Bencomo Domínguez-Martín, Hipólito Hernández-Pérez, Jorge Riera-Ledesma, Inmaculada Rodríguez Martín
A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem. Comput. Oper. Res. 161 (2024)
Jorge Riera-Ledesma, Juan José Salazar González
Selective routing problem with synchronization. Comput. Oper. Res. 135 (2021)
Jorge Riera-Ledesma, Juan José Salazar González
Solving the Team Orienteering Arc Routing Problem with a column generation approach. Eur. J. Oper. Res. 262 (1) (2017)
Daniele Manerba, Renata Mansini, Jorge Riera-Ledesma
The Traveling Purchaser Problem and its variants. Eur. J. Oper. Res. 259 (1) (2017)
Manuel Iori, Jorge Riera-Ledesma
Exact algorithms for the double vehicle routing problem with multiple stacks. Comput. Oper. Res. 63 (2015)
María Batista-Galván, Jorge Riera-Ledesma, Juan José Salazar González
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach. Comput. Oper. Res. 40 (8) (2013)
Hipólito Hernández-Pérez, Jorge Riera-Ledesma, Inmaculada Rodríguez Martín, Juan José Salazar González
International Network Optimization Conference, Tenerife 2013. Electron. Notes Discret. Math. 41 (2013)
Luis Eduardo Neves Gouveia, Jorge Riera-Ledesma, Juan José Salazar González
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. Networks 61 (4) (2013)
Jorge Riera-Ledesma, Juan José Salazar González
A column generation approach for a school bus routing problem with resource constraints. Comput. Oper. Res. 40 (2) (2013)
Jorge Riera-Ledesma, Juan José Salazar González
Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach. Comput. Oper. Res. 39 (2) (2012)
Jorge Riera-Ledesma, Juan José Salazar González
A branch-and-cut algorithm for the continuous error localization problem in data cleaning. Comput. Oper. Res. 34 (9) (2007)
Jorge Riera-Ledesma, Juan José Salazar González
A heuristic approach for the continuous error localization problem in data cleaning. Comput. Oper. Res. 34 (8) (2007)
Jorge Riera-Ledesma, Juan José Salazar González
Solving the asymmetric traveling purchaser problem. Ann. Oper. Res. 144 (1) (2006)
Jorge Riera-Ledesma, Juan José Salazar González
The biobjective travelling purchaser problem. Eur. J. Oper. Res. 160 (3) (2005)
Jorge Riera-Ledesma, Juan José Salazar González
A heuristic approach for the Travelling Purchaser Problem. Eur. J. Oper. Res. 162 (1) (2005)
Gilbert Laporte, Jorge Riera-Ledesma, Juan José Salazar González
A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem. Oper. Res. 51 (6) (2003)