Publicaciones (36) Publicaciones de Inmaculada Rodríguez Martín

2024

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

    Computers and Operations Research, Vol. 161

2023

  1. An efficient multistart heuristic for the driver and vehicle routing problem

    Computers and Operations Research, Vol. 150

2022

  1. Periodic Vehicle Routing Problem with Driver Consistency and service time optimization

    Transportation Research Part B: Methodological, Vol. 166, pp. 468-484

2021

  1. Dissecting the stellar content of Leo I: A dwarf irregular caught in transition

    Monthly Notices of the Royal Astronomical Society, Vol. 501, Núm. 3, pp. 3962-3980

  2. Effective algorithms for the economic lot-sizing problem with bounded inventory and linear fixed-charge cost structure

    Mathematics, Vol. 9, Núm. 6

  3. Preface: Public transport planning in the face of uncertainty

    EURO Journal on Transportation and Logistics

  4. The single-vehicle two-echelon one-commodity pickup and delivery problem

    Computers and Operations Research, Vol. 127

2019

  1. The periodic vehicle routing problem with driver consistency

    European Journal of Operational Research, Vol. 273, Núm. 2, pp. 575-584

2018

  1. A heuristic approach to the driver and vehicle routing problem

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. The driver and vehicle routing problem

    Computers and Operations Research, Vol. 92, pp. 56-64

2017

  1. An exact algorithm for a Vehicle-and-Driver Scheduling Problem

    Computers and Operations Research, Vol. 81, pp. 247-256

2016

  1. A branch-and-cut algorithm for two-level survivable network design problems

    Computers and Operations Research, Vol. 67, pp. 102-112

  2. A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem

    European Journal of Operational Research, Vol. 251, Núm. 1, pp. 44-52

  3. Hierarchical Survivable Network Design Problems

    Electronic Notes in Discrete Mathematics, Vol. 52, pp. 229-236

  4. The ring/κ-rings network design problem: Model and branch-and-cut algorithm

    Networks, Vol. 68, Núm. 2, pp. 130-140

2014

  1. A branch-and-cut algorithm for the hub location and routing problem

    Computers and Operations Research, Vol. 50, pp. 161-174

2013

  1. A variable neighborhood search for the multi-commodity pickup-and-delivery TSP

    XXXIV Congreso Nacional de Estadística e Investigación Operativa, VIII Jornadas de Estadística Pública: SEIO 2013. Universitat Jaume I, Castellón, septiembre 2013. Libro de actas

  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

2012

  1. A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem

    Journal of Heuristics, Vol. 18, Núm. 6, pp. 849-867