default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Duque
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j11]Daniel Duque
, Sanjay Mehrotra, David P. Morton:
Distributionally Robust Two-Stage Stochastic Programming. SIAM J. Optim. 32(3): 1499-1522 (2022)- 2020
- [j10]John E. Fontecha, Oscar O. Guaje, Daniel Duque, Raha Akhavan-Tabatabaei, Juan Pablo Rodríguez, Andrés L. Medaglia:
Combined maintenance and routing optimization for large-scale sewage cleaning. Ann. Oper. Res. 286(1): 441-474 (2020) - [j9]Nicolás Cabrera, Andrés L. Medaglia, Leonardo Lozano, Daniel Duque:
An exact bidirectional pulse algorithm for the constrained shortest path. Networks 76(2): 128-146 (2020) - [j8]Jorge A. Huertas, Daniel Duque, Ethel Segura-Durán, Raha Akhavan-Tabatabaei, Andrés L. Medaglia:
Evacuation dynamics: a modeling and visualization framework. OR Spectr. 42(3): 661-691 (2020) - [j7]Daniel Duque, David P. Morton:
Distributionally Robust Stochastic Dual Dynamic Programming. SIAM J. Optim. 30(4): 2841-2865 (2020)
2010 – 2019
- 2019
- [j6]Daniel Duque, Andrés L. Medaglia:
An exact method for a class of robust shortest path problems with scenarios. Networks 74(4): 360-373 (2019) - 2018
- [j5]Jose L. Cercos-Pita, I. R. Cal, Daniel Duque, G. Sanjuán de Moreta:
NASAL-Geom, a free upper respiratory tract 3D model reconstruction software. Comput. Phys. Commun. 223: 55-68 (2018) - 2017
- [j4]Daniel Duque, Pep Español, Jaime Arturo de la Torre:
Extending linear finite elements to quadratic precision on arbitrary meshes. Appl. Math. Comput. 301: 201-213 (2017) - 2016
- [j3]Leonardo Lozano, Daniel Duque, Andrés L. Medaglia:
An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints. Transp. Sci. 50(1): 348-357 (2016) - 2015
- [j2]Daniel Duque, Leonardo Lozano, Andrés L. Medaglia:
Solving the Orienteering Problem with Time Windows via the Pulse Framework. Comput. Oper. Res. 54: 168-176 (2015) - [j1]Daniel Duque, Leonardo Lozano, Andrés L. Medaglia:
An exact method for the biobjective shortest path problem for large-scale road networks. Eur. J. Oper. Res. 242(3): 788-797 (2015)
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-04-25 05:59 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:
