Inmaculada Rodríguez Martín

Orcid: 0000-0003-4877-733X

According to our database1, Inmaculada Rodríguez Martín authored at least 26 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem.
Comput. Oper. Res., January, 2024

2023
An efficient multistart heuristic for the driver and vehicle routing problem.
Comput. Oper. Res., 2023

2021
Preface: Public transport planning in the face of uncertainty.
EURO J. Transp. Logist., 2021

The single-vehicle two-echelon one-commodity pickup and delivery problem.
Comput. Oper. Res., 2021

2019
The periodic vehicle routing problem with driver consistency.
Eur. J. Oper. Res., 2019

2018
The driver and vehicle routing problem.
Comput. Oper. Res., 2018

A Heuristic Approach to the Driver and Vehicle Routing Problem.
Proceedings of the Computational Logistics - 9th International Conference, 2018

2017
An exact algorithm for a Vehicle-and-Driver Scheduling Problem.
Comput. Oper. Res., 2017

2016
The ring/<i>κ</i>-rings network design problem: Model and branch-and-cut algorithm.
Networks, 2016

A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem.
Eur. J. Oper. Res., 2016

Hierarchical Survivable Network Design Problems.
Electron. Notes Discret. Math., 2016

A branch-and-cut algorithm for two-level survivable network design problems.
Comput. Oper. Res., 2016

2014
A branch-and-cut algorithm for the hub location and routing problem.
Comput. Oper. Res., 2014

2013
International Network Optimization Conference, Tenerife 2013.
Electron. Notes Discret. Math., 2013

2012
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem.
J. Heuristics, 2012

2011
The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
A local branching heuristic for the capacitated fixed-charge network design problem.
Comput. Oper. Res., 2010

2009
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem.
Comput. Oper. Res., 2009

2008
Solving a capacitated hub location problem.
Eur. J. Oper. Res., 2008

2007
Locating a cycle in a transportation or a telecommunications network.
Networks, 2007

2006
An Iterated Local Search Heuristic for a Capacitated Hub Location Problem.
Proceedings of the Hybrid Metaheuristics, Third International Workshop, 2006

2005
Locating median cycles in networks.
Eur. J. Oper. Res., 2005

2004
The Ring Star Problem: Polyhedral analysis and exact algorithm.
Networks, 2004

A branch-and-cut algorithm for the plant-cycle location problem.
J. Oper. Res. Soc., 2004

Decomposition Approaches for a Capacitated Hub Problem.
Proceedings of the Advances in Artificial Intelligence, 2004

2003
Variable neighborhood tabu search and its application to the median cycle problem.
Eur. J. Oper. Res., 2003


  Loading...