default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan José Salazar González
Publications
- 2022
[j84]Hipólito Hernández-Pérez, Juan José Salazar González
:
A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 297(2): 467-483 (2022)- 2019
- [c15]Hipólito Hernández-Pérez, Juan José Salazar González:
Optimal Solutions for the Vehicle Routing Problem with Split Demands. ICCL 2019: 189-203 - 2018
- [j75]Hipólito Hernández-Pérez, Juan José Salazar González, Beatriz Santos-Hernández:
Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem. Comput. Oper. Res. 97: 1-17 (2018) - [c13]Hipólito Hernández-Pérez, Juan José Salazar González:
An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem. ISCO 2018: 241-252 - 2016
- [j65]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) - 2014
- [j56]Hipólito Hernández-Pérez, Juan José Salazar González:
The multi-commodity pickup-and-delivery traveling salesman problem. Networks 63(1): 46-59 (2014) - 2013
- [j53]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) - 2009
- [j38]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) - [j37]Hipólito Hernández-Pérez, Juan José Salazar González:
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem. Eur. J. Oper. Res. 196(3): 987-995 (2009) - 2007
- [j27]Hipólito Hernández-Pérez, Juan José Salazar González:
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms. Networks 50(4): 258-272 (2007) - 2004
- [j17]Hipólito Hernández-Pérez, Juan José Salazar González:
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discret. Appl. Math. 145(1): 126-139 (2004) - [j13]Hipólito Hernández-Pérez, Juan José Salazar González:
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem. Transp. Sci. 38(2): 245-255 (2004) - 2001
- [c1]Hipólito Hernández-Pérez, Juan José Salazar González:
The One-Commodity Pickup-and-Delivery Travelling Salesman Problem. Combinatorial Optimization 2001: 89-104
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 2025-01-20 22:59 CET 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:
