Inmaculada Rodríguez Martín

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 12

Top Topics

Benchmark Instances

Network Design Problem

Routing Problem

Miller Tucker Zemlin

Top Venues

Comput. Oper. Res.

Electron. Notes Discret. Math.

Eur. J. Oper. Res.

Publications

Bencomo Domínguez-Martín, Hipólito Hernández-Pérez, Jorge Riera-Ledesma, Inmaculada Rodríguez Martín
A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem. Comput. Oper. Res. 161 (2024)
Bencomo Domínguez-Martín, Inmaculada Rodríguez Martín, Juan José Salazar González
An efficient multistart heuristic for the driver and vehicle routing problem. Comput. Oper. Res. 150 (2023)
Hipólito Hernández-Pérez, Mercedes Landete, Inmaculada Rodríguez Martín
The single-vehicle two-echelon one-commodity pickup and delivery problem. Comput. Oper. Res. 127 (2021)
Marie Schmidt, Konstantinos Gkiotsalitis, Inmaculada Rodríguez Martín
Preface: Public transport planning in the face of uncertainty. EURO J. Transp. Logist. 10 (2021)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
The periodic vehicle routing problem with driver consistency. Eur. J. Oper. Res. 273 (2) (2019)
Bencomo Domínguez-Martín, Inmaculada Rodríguez Martín, Juan José Salazar González
A Heuristic Approach to the Driver and Vehicle Routing Problem. ICCL (2018)
Bencomo Domínguez-Martín, Inmaculada Rodríguez Martín, Juan José Salazar González
The driver and vehicle routing problem. Comput. Oper. Res. 92 (2018)
Bencomo Domínguez-Martín, Inmaculada Rodríguez Martín, Juan José Salazar González
An exact algorithm for a Vehicle-and-Driver Scheduling Problem. Comput. Oper. Res. 81 (2017)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
-rings network design problem: Model and branch-and-cut algorithm. Networks 68 (2) (2016)
Hipólito Hernández-Pérez, Inmaculada Rodríguez Martín, Juan José Salazar González
A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem. Eur. J. Oper. Res. 251 (1) (2016)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
Hierarchical Survivable Network Design Problems. Electron. Notes Discret. Math. 52 (2016)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
A branch-and-cut algorithm for two-level survivable network design problems. Comput. Oper. Res. 67 (2016)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
A branch-and-cut algorithm for the hub location and routing problem. Comput. Oper. Res. 50 (2014)
Hipólito Hernández-Pérez, Jorge Riera-Ledesma, Inmaculada Rodríguez Martín, Juan José Salazar González
International Network Optimization Conference, Tenerife 2013. Electron. Notes Discret. Math. 41 (2013)
Inmaculada Rodríguez Martín, Juan José Salazar González
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem. J. Heuristics 18 (6) (2012)
Inmaculada Rodríguez Martín, Juan José Salazar González
The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic. INOC (2011)
Inmaculada Rodríguez Martín, Juan José Salazar González
A local branching heuristic for the capacitated fixed-charge network design problem. Comput. Oper. Res. 37 (3) (2010)
Hipólito Hernández-Pérez, Inmaculada Rodríguez Martín, Juan José Salazar González
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Comput. Oper. Res. 36 (5) (2009)
Inmaculada Rodríguez Martín, Juan José Salazar González
Solving a capacitated hub location problem. Eur. J. Oper. Res. 184 (2) (2008)
Gilbert Laporte, Inmaculada Rodríguez Martín
Locating a cycle in a transportation or a telecommunications network. Networks 50 (1) (2007)
Inmaculada Rodríguez Martín, Juan José Salazar González
An Iterated Local Search Heuristic for a Capacitated Hub Location Problem. Hybrid Metaheuristics (2006)
Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González
Locating median cycles in networks. Eur. J. Oper. Res. 160 (2) (2005)
Martine Labbé, Inmaculada Rodríguez Martín, Juan José Salazar González
A branch-and-cut algorithm for the plant-cycle location problem. J. Oper. Res. Soc. 55 (5) (2004)
Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González
The Ring Star Problem: Polyhedral analysis and exact algorithm. Networks 43 (3) (2004)
Inmaculada Rodríguez Martín, Juan José Salazar González
Decomposition Approaches for a Capacitated Hub Problem. IBERAMIA (2004)
José A. Moreno-Pérez, J. Marcos Moreno-Vega, Inmaculada Rodríguez Martín
Variable neighborhood tabu search and its application to the median cycle problem. Eur. J. Oper. Res. 151 (2) (2003)