Variable neighborhood tabu search and its application to the median cycle problem. - José A. Moreno-Pérez; J. Marcos Moreno-Vega; Inmaculada Rodríguez Martín (Eur. J. Oper. Res., 2003)

Decomposition Approaches for a Capacitated Hub Problem. - Inmaculada Rodríguez Martín; Juan José Salazar González (IBERAMIA, 2004)

A branch-and-cut algorithm for the plant-cycle location problem. - Martine Labbé; Inmaculada Rodríguez Martín; Juan José Salazar González (J. Oper. Res. Soc., 2004)

The Ring Star Problem: Polyhedral analysis and exact algorithm. - Martine Labbé; Gilbert Laporte; Inmaculada Rodríguez Martín; Juan José Salazar González (Networks, 2004)

Locating median cycles in networks. - Martine Labbé; Gilbert Laporte; Inmaculada Rodríguez Martín; Juan José Salazar González (Eur. J. Oper. Res., 2005)

An Iterated Local Search Heuristic for a Capacitated Hub Location Problem. - Inmaculada Rodríguez Martín; Juan José Salazar González (Hybrid Metaheuristics, 2006)

Locating a cycle in a transportation or a telecommunications network. - Gilbert Laporte; Inmaculada Rodríguez Martín (Networks, 2007)

Solving a capacitated hub location problem. - Inmaculada Rodríguez Martín; Juan José Salazar González (Eur. J. Oper. Res., 2008)

A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. - Hipólito Hernández-Pérez; Inmaculada Rodríguez Martín; Juan José Salazar González (Comput. Oper. Res., 2009)

A local branching heuristic for the capacitated fixed-charge network design problem. - Inmaculada Rodríguez Martín; Juan José Salazar González (Comput. Oper. Res., 2010)

The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic. - Inmaculada Rodríguez Martín; Juan José Salazar González (INOC, 2011)

A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem. - Inmaculada Rodríguez Martín; Juan José Salazar González (J. Heuristics, 2012)

International Network Optimization Conference, Tenerife 2013. - Hipólito Hernández-Pérez; Jorge Riera-Ledesma; Inmaculada Rodríguez Martín; Juan José Salazar González (Electron. Notes Discret. Math., 2013)

A branch-and-cut algorithm for the hub location and routing problem. - Inmaculada Rodríguez Martín; Juan José Salazar González; Hande Yaman (Comput. Oper. Res., 2014)

A branch-and-cut algorithm for two-level survivable network design problems. - Inmaculada Rodríguez Martín; Juan José Salazar González; Hande Yaman (Comput. Oper. Res., 2016)

Hierarchical Survivable Network Design Problems. - Inmaculada Rodríguez Martín; Juan José Salazar González; Hande Yaman (Electron. Notes Discret. Math., 2016)

A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem. - Hipólito Hernández-Pérez; Inmaculada Rodríguez Martín; Juan José Salazar González (Eur. J. Oper. Res., 2016)

The ring/κ-rings network design problem: Model and branch-and-cut algorithm. - Inmaculada Rodríguez Martín; Juan José Salazar González; Hande Yaman (Networks, 2016)

An exact algorithm for a Vehicle-and-Driver Scheduling Problem. - Bencomo Domínguez-Martín; Inmaculada Rodríguez Martín; Juan José Salazar González (Comput. Oper. Res., 2017)

A Heuristic Approach to the Driver and Vehicle Routing Problem. - Bencomo Domínguez-Martín; Inmaculada Rodríguez Martín; Juan José Salazar González (ICCL, 2018)

The driver and vehicle routing problem. - Bencomo Domínguez-Martín; Inmaculada Rodríguez Martín; Juan José Salazar González (Comput. Oper. Res., 2018)

The periodic vehicle routing problem with driver consistency. - Inmaculada Rodríguez Martín; Juan José Salazar González; Hande Yaman (Eur. J. Oper. Res., 2019)

The single-vehicle two-echelon one-commodity pickup and delivery problem. - Hipólito Hernández-Pérez; Mercedes Landete; Inmaculada Rodríguez Martín (Comput. Oper. Res., 2021)

Preface: Public transport planning in the face of uncertainty. - Marie Schmidt; Konstantinos Gkiotsalitis; Inmaculada Rodríguez Martín (EURO J. Transp. Logist., 2021)

An efficient multistart heuristic for the driver and vehicle routing problem. - Bencomo Domínguez-Martín; Inmaculada Rodríguez Martín; Juan José Salazar González (Comput. Oper. Res., 2023)

A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem. - Bencomo Domínguez-Martín; Hipólito Hernández-Pérez; Jorge Riera-Ledesma; Inmaculada Rodríguez Martín (Comput. Oper. Res., 2024)