Jorge Riera-Ledesma

According to our database, Jorge Riera-Ledesma authored at least 16 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

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

Bencomo Domínguez-Martín, Hipólito Hernández-Pérez, Jorge Riera-Ledesma, Inmaculada Rodríguez Martín

Comput. Oper. Res., January, 2024

2021

Selective routing problem with synchronization.

Jorge Riera-Ledesma, Juan José Salazar González

Comput. Oper. Res., 2021

2017

Solving the Team Orienteering Arc Routing Problem with a column generation approach.

Jorge Riera-Ledesma, Juan José Salazar González

Eur. J. Oper. Res., 2017

The Traveling Purchaser Problem and its variants.

Daniele Manerba, Renata Mansini, Jorge Riera-Ledesma

Eur. J. Oper. Res., 2017

2015

Exact algorithms for the double vehicle routing problem with multiple stacks.

Manuel Iori, Jorge Riera-Ledesma

Comput. Oper. Res., 2015

2013

Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route.

Luis Eduardo Neves Gouveia, Jorge Riera-Ledesma, Juan José Salazar González

Networks, 2013

International Network Optimization Conference, Tenerife 2013.

Hipólito Hernández-Pérez, Jorge Riera-Ledesma, Inmaculada Rodríguez Martín, Juan José Salazar González

Electron. Notes Discret. Math., 2013

A column generation approach for a school bus routing problem with resource constraints.

Jorge Riera-Ledesma, Juan José Salazar González

Comput. Oper. Res., 2013

The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach.

María Batista-Galván, Jorge Riera-Ledesma, Juan José Salazar González

Comput. Oper. Res., 2013

2012

Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach.

Jorge Riera-Ledesma, Juan José Salazar González

Comput. Oper. Res., 2012

2007

A branch-and-cut algorithm for the continuous error localization problem in data cleaning.

Jorge Riera-Ledesma, Juan José Salazar González

Comput. Oper. Res., 2007

A heuristic approach for the continuous error localization problem in data cleaning.

Jorge Riera-Ledesma, Juan José Salazar González

Comput. Oper. Res., 2007

2006

Solving the asymmetric traveling purchaser problem.

Jorge Riera-Ledesma, Juan José Salazar González

Ann. Oper. Res., 2006

2005

The biobjective travelling purchaser problem.

Jorge Riera-Ledesma, Juan José Salazar González

Eur. J. Oper. Res., 2005

A heuristic approach for the Travelling Purchaser Problem.

Jorge Riera-Ledesma, Juan José Salazar González

Eur. J. Oper. Res., 2005

2003

A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem.

Gilbert Laporte, Jorge Riera-Ledesma, Juan José Salazar González

Oper. Res., 2003