default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInmaculada Rodríguez Martín
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]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: 106426 (2024)- 2023
- [j21]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: 106076 (2023) - 2021
- [j20]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: 105152 (2021) - [j19]Marie Schmidt, Konstantinos Gkiotsalitis, Inmaculada Rodríguez Martín:
Preface: Public transport planning in the face of uncertainty. EURO J. Transp. Logist. 10: 100035 (2021)
2010 – 2019
- 2019
- [j18]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): 575-584 (2019) - 2018
- [j17]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: 56-64 (2018) - [c4]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: 295-305 - 2017
- [j16]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: 247-256 (2017) - 2016
- [j15]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: 102-112 (2016) - [j14]Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman:
Hierarchical Survivable Network Design Problems. Electron. Notes Discret. Math. 52: 229-236 (2016) - [j13]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): 44-52 (2016) - [j12]Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman:
The ring/κ-rings network design problem: Model and branch-and-cut algorithm. Networks 68(2): 130-140 (2016) - 2014
- [j11]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: 161-174 (2014) - 2013
- [j10]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: 1-3 (2013) - 2012
- [j9]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): 849-867 (2012) - 2011
- [c3]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: 401-405 - 2010
- [j8]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): 575-581 (2010)
2000 – 2009
- 2009
- [j7]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): 1639-1645 (2009) - 2008
- [j6]Inmaculada Rodríguez Martín, Juan José Salazar González:
Solving a capacitated hub location problem. Eur. J. Oper. Res. 184(2): 468-479 (2008) - 2007
- [j5]Gilbert Laporte, Inmaculada Rodríguez Martín:
Locating a cycle in a transportation or a telecommunications network. Networks 50(1): 92-108 (2007) - 2006
- [c2]Inmaculada Rodríguez Martín, Juan José Salazar González:
An Iterated Local Search Heuristic for a Capacitated Hub Location Problem. Hybrid Metaheuristics 2006: 70-81 - 2005
- [j4]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): 457-470 (2005) - 2004
- [j3]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): 513-520 (2004) - [j2]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): 177-189 (2004) - [c1]Inmaculada Rodríguez Martín, Juan José Salazar González:
Decomposition Approaches for a Capacitated Hub Problem. IBERAMIA 2004: 154-163 - 2003
- [j1]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): 365-378 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
