Publicaciones (22) Publicaciones de Jorge Riera Ledesma

2024

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

    Computers and Operations Research, Vol. 161

2021

  1. Selective routing problem with synchronization

    Computers and Operations Research, Vol. 135

2018

  1. Target allocation and motion planning for MIRADAS probe arms (9913-115)

    Proceedings of SPIE - The International Society for Optical Engineering

2017

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

    European Journal of Operational Research, Vol. 262, Núm. 1, pp. 14-27

  2. The Traveling Purchaser Problem and its variants

    European Journal of Operational Research, Vol. 259, Núm. 1, pp. 1-18

2016

  1. Target allocation and prioritized motion planning for MIRADAS probe arms

    Proceedings of SPIE - The International Society for Optical Engineering

2015

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

    Computers and Operations Research, Vol. 63, pp. 83-101

  2. Resolviendo el "Team Orieering Arc Routing Problem" mediante generación de columnas

    XXXV Congreso Nacional SEIO: IX Jornadas de Estadística Pública : Universidad Pública de Navarra, Pamplona, del 26 al 29 de mayo de 2015

2013

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

    Computers and Operations Research, Vol. 40, Núm. 2, pp. 566-583

  2. Diseño automático de horario y agenda sujeto a ciertos criterios de calidad para centros con recursos limitados de espacio

    Innovación Docente en la Educación Superior [Recurso electrónico]: Una recopilación de experiencias prácticas aplicadas

  3. International network optimization conference, Tenerife 2013

    Electronic Notes in Discrete Mathematics

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

    Networks, Vol. 61, Núm. 4, pp. 309-321

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

    Computers and Operations Research, Vol. 40, Núm. 8, pp. 2103-2115

2012

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

    Computers and Operations Research, Vol. 39, Núm. 2, pp. 391-404

2007

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

    Computers and Operations Research, Vol. 34, Núm. 9, pp. 2790-2804

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

    Computers and Operations Research, Vol. 34, Núm. 8, pp. 2370-2383

2006

  1. Solving the asymmetric traveling purchaser problem

    Annals of Operations Research, Vol. 144, Núm. 1, pp. 83-97

2005

  1. A heuristic approach for the Travelling Purchaser Problem

    European Journal of Operational Research, Vol. 162, Núm. 1, pp. 142-152

  2. The biobjective travelling purchaser problem

    European Journal of Operational Research, Vol. 160, Núm. 3, pp. 599-613

2003

  1. A branch-and-cut algorithm for the undirected traveling purchaser problem

    Operations Research, Vol. 51, Núm. 6, pp. 940-951+1004