Jorge Riera-Ledesma

18 papers Journal 18
YearRankTypeTitle / Venue / Authors
2026 J jnl
Dual-driven path elimination for vehicle routing with idle times and arrival-time consistency.
Comput. Oper. Res.
Jorge Riera-Ledesma, Inmaculada Rodríguez Martín, Hipólito Hernández-Pérez
2026 J jnl
Optimal area polygonisation problems: Mixed integer linear programming models.
Eur. J. Oper. Res.
Hipólito Hernández-Pérez, Jorge Riera-Ledesma, Inmaculada Rodríguez Martín, Juan José Salazar González
2024 J jnl
A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem.
Comput. Oper. Res.
Bencomo Domínguez-Martín, Hipólito Hernández-Pérez, Jorge Riera-Ledesma, Inmaculada Rodríguez Martín
2021 J jnl
Selective routing problem with synchronization.
Comput. Oper. Res.
Jorge Riera-Ledesma, Juan José Salazar González
2017 J jnl
Solving the Team Orienteering Arc Routing Problem with a column generation approach.
Eur. J. Oper. Res.
Jorge Riera-Ledesma, Juan José Salazar González
2017 J jnl
The Traveling Purchaser Problem and its variants.
Eur. J. Oper. Res.
Daniele Manerba, Renata Mansini, Jorge Riera-Ledesma
2015 J jnl
Exact algorithms for the double vehicle routing problem with multiple stacks.
Comput. Oper. Res.
Manuel Iori, Jorge Riera-Ledesma
2013 J jnl
A column generation approach for a school bus routing problem with resource constraints.
Comput. Oper. Res.
Jorge Riera-Ledesma, Juan José Salazar González
2013 J jnl
International Network Optimization Conference, Tenerife 2013.
Electron. Notes Discret. Math.
Hipólito Hernández-Pérez, Jorge Riera-Ledesma, Inmaculada Rodríguez Martín, Juan José Salazar González
2013 J jnl
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route.
Networks
Luis Eduardo Neves Gouveia, Jorge Riera-Ledesma, Juan José Salazar González
2013 J jnl
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach.
Comput. Oper. Res.
María Batista-Galván, Jorge Riera-Ledesma, Juan José Salazar González
2012 J jnl
Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach.
Comput. Oper. Res.
Jorge Riera-Ledesma, Juan José Salazar González
2007 J jnl
A branch-and-cut algorithm for the continuous error localization problem in data cleaning.
Comput. Oper. Res.
Jorge Riera-Ledesma, Juan José Salazar González
2007 J jnl
A heuristic approach for the continuous error localization problem in data cleaning.
Comput. Oper. Res.
Jorge Riera-Ledesma, Juan José Salazar González
2006 J jnl
Solving the asymmetric traveling purchaser problem.
Ann. Oper. Res.
Jorge Riera-Ledesma, Juan José Salazar González
2005 J jnl
A heuristic approach for the Travelling Purchaser Problem.
Eur. J. Oper. Res.
Jorge Riera-Ledesma, Juan José Salazar González
2005 J jnl
The biobjective travelling purchaser problem.
Eur. J. Oper. Res.
Jorge Riera-Ledesma, Juan José Salazar González
2003 J jnl
A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem.
Oper. Res.
Gilbert Laporte, Jorge Riera-Ledesma, Juan José Salazar González