default search action
Jorge Riera-Ledesma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Bencomo Domínguez-Martín
, Hipólito Hernández-Pérez
A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem. Comput. Oper. Res. 161: 106426 (2024) - 2021
- [j15]Jorge Riera-Ledesma
Selective routing problem with synchronization. Comput. Oper. Res. 135: 105465 (2021)
2010 – 2019
- 2017
- [j14]Daniele Manerba
The Traveling Purchaser Problem and its variants. Eur. J. Oper. Res. 259(1): 1-18 (2017) - [j13]Jorge Riera-Ledesma
Solving the Team Orienteering Arc Routing Problem with a column generation approach. Eur. J. Oper. Res. 262(1): 14-27 (2017) - 2015
- [j12]Manuel Iori
Exact algorithms for the double vehicle routing problem with multiple stacks. Comput. Oper. Res. 63: 83-101 (2015) - 2013
- [j11]Jorge Riera-Ledesma
A column generation approach for a school bus routing problem with resource constraints. Comput. Oper. Res. 40(2): 566-583 (2013) - [j10]María Batista-Galván, Jorge Riera-Ledesma
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach. Comput. Oper. Res. 40(8): 2103-2115 (2013) - [j9]Hipólito Hernández-Pérez, Jorge Riera-Ledesma
International Network Optimization Conference, Tenerife 2013. Electron. Notes Discret. Math. 41: 1-3 (2013) - [j8]Luis Eduardo Neves Gouveia
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. Networks 61(4): 309-321 (2013) - 2012
- [j7]Jorge Riera-Ledesma
Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach. Comput. Oper. Res. 39(2): 391-404 (2012)
2000 – 2009
- 2007
- [j6]Jorge Riera-Ledesma
A heuristic approach for the continuous error localization problem in data cleaning. Comput. Oper. Res. 34(8): 2370-2383 (2007) - [j5]Jorge Riera-Ledesma
A branch-and-cut algorithm for the continuous error localization problem in data cleaning. Comput. Oper. Res. 34(9): 2790-2804 (2007) - 2006
- [j4]Jorge Riera-Ledesma
Solving the asymmetric traveling purchaser problem. Ann. Oper. Res. 144(1): 83-97 (2006) - 2005
- [j3]Jorge Riera-Ledesma
The biobjective travelling purchaser problem. Eur. J. Oper. Res. 160(3): 599-613 (2005) - [j2]Jorge Riera-Ledesma
A heuristic approach for the Travelling Purchaser Problem. Eur. J. Oper. Res. 162(1): 142-152 (2005) - 2003
- [j1]Gilbert Laporte, Jorge Riera-Ledesma
A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem. Oper. Res. 51(6): 940-951 (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 21:24 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: