Seguir
Jorge Riera-Ledesma
Jorge Riera-Ledesma
Departamento de Ingeniería Informática y de Sistemas - Universidad de La Laguna
Dirección de correo verificada de ull.edu.es
Título
Citado por
Citado por
Año
Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach
J Riera-Ledesma, JJ Salazar-Gonzalez
Computers & Operations Research 39 (2), 391-404, 2012
1492012
A branch-and-cut algorithm for the undirected traveling purchaser problem
G Laporte, J Riera-Ledesma, JJ Salazar-González
Operations Research 51 (6), 940-951, 2003
1172003
A column generation approach for a school bus routing problem with resource constraints
J Riera-Ledesma, JJ Salazar-González
Computers & Operations Research 40 (2), 566-583, 2013
1002013
The biobjective travelling purchaser problem
J Riera-Ledesma, JJ Salazar-González
European Journal of Operational Research 160 (3), 599-613, 2005
802005
The traveling purchaser problem and its variants
D Manerba, R Mansini, J Riera-Ledesma
European Journal of Operational Research 259 (1), 1-18, 2017
772017
A heuristic approach for the travelling purchaser problem
J Riera-Ledesma, JJ Salazar-González
European Journal of Operational Research 162 (1), 142-152, 2005
772005
Exact algorithms for the double vehicle routing problem with multiple stacks
M Iori, J Riera-Ledesma
Computers & Operations Research 63, 83-101, 2015
522015
Solving the asymmetric traveling purchaser problem
J Riera-Ledesma, JJ Salazar-González
Annals of Operations Research 144 (1), 83-97, 2006
452006
Solving the team orienteering arc routing problem with a column generation approach
J Riera-Ledesma, JJ Salazar-González
European Journal of Operational Research 262 (1), 14-27, 2017
222017
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach
M Batista-Galván, J Riera-Ledesma, JJ Salazar-González
Computers & operations research 40 (8), 2103-2115, 2013
222013
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
L Gouveia, J Riera‐Ledesma, JJ Salazar‐González
Networks 61 (4), 309-321, 2013
172013
A branch-and-cut algorithm for the continuous error localization problem in data cleaning
J Riera-Ledesma, JJ Salazar-González
Computers & operations research 34 (9), 2790-2804, 2007
112007
Approximate algorithms for theP‖Cmax problem
J Riera-Ledesma, D Alcaide, J Sicilia
TOP 4 (2), 345-359, 1996
10*1996
New Algorithms for the Editing and Imputation Problem
J Riera-Ledesma, JJ Salazar-Gonzalez
UNECE Statistical Data Editing Work Session, Madrid, Spain, 1-24, 2003
92003
A heuristic approach for the continuous error localization problem in data cleaning
J Riera-Ledesma, JJ Salazar-González
Computers & operations research 34 (8), 2370-2383, 2007
72007
The traveling purchaser problem
J Riera Ledesma
52002
Solving a school bus routing problem
J Riera-Ledesma, JJ Salazar-González
Odysseus, 2006
42006
A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
B Domínguez-Martín, H Hernández-Pérez, J Riera-Ledesma, ...
Computers & Operations Research 161, 106426, 2024
22024
Target allocation and prioritized motion planning for MIRADAS probe arms
J Sabater, J Riera-Ledesma, S Torres, F Garzón, J Torra, JM Gómez
Software and Cyberinfrastructure for Astronomy IV 9913, 1011-1026, 2016
22016
Algorithms for automatic data editing
J Riera-Ledesma, JJ Salazar-González
Statistical Journal of the United Nations Economic Commission for Europe 20 …, 2003
22003
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20