default search action
Leonardo Lozano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j17]Mehdi Ansari
, Juan Sebastian Borrero, Leonardo Lozano
Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions. INFORMS J. Comput. 35(1): 83-103 (2023) - [j16]David Bergman, Carlos Cardonha
Optimizing the Expected Maximum of Two Linear Functions Defined on a Multivariate Gaussian Distribution. INFORMS J. Comput. 35(2): 304-317 (2023) - [j15]Keliang Wang
Optimizing over an Ensemble of Trained Neural Networks. INFORMS J. Comput. 35(3): 652-674 (2023) - 2022
- [j14]Leonardo Lozano
A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs. Math. Program. 191(1): 381-404 (2022) - [i3]Chenbo Shi, Mohsen Emadikhiav, Leonardo Lozano, David Bergman:
Careful! Training Relevance is Real. CoRR abs/2201.04429 (2022) - [i2]Leonardo Lozano, David Bergman, André A. Ciré:
Constrained Shortest-Path Reformulations for Discrete Bilevel and Robust Optimization. CoRR abs/2206.12962 (2022) - 2021
- [j13]Leonardo Lozano
Decision diagram-based integer programming for the paired job scheduling problem. IISE Trans. 53(6): 671-684 (2021) - [j12]David Bergman
Decision Diagram Decomposition for Quadratically Constrained Binary Optimization. INFORMS J. Comput. 33(1): 401-418 (2021) - [j11]Juan Sebastian Borrero
Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets. INFORMS J. Comput. 33(4): 1570-1589 (2021) - [c2]Keliang Wang, Leonardo Lozano, David Bergman, Carlos Cardonha:
A Two-Stage Exact Algorithm for Optimization of Neural Network Ensemble. CPAIOR 2021: 106-114 - [i1]Keliang Wang, Leonardo Lozano, Carlos Cardonha, David Bergman:
Acceleration techniques for optimization over trained neural network ensembles. CoRR abs/2112.07007 (2021) - 2020
- [j10]Leonardo Lozano
On the Consistent Path Problem. Oper. Res. 68(6): 1913-1931 (2020) - [j9]Nicolás Cabrera
An exact bidirectional pulse algorithm for the constrained shortest path. Networks 76(2): 128-146 (2020)
2010 – 2019
- 2017
- [j8]Leonardo Lozano
A Backward Sampling Framework for Interdiction Problems with Fortification. INFORMS J. Comput. 29(1): 123-139 (2017) - [j7]Leonardo Lozano
A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem. Oper. Res. 65(3): 768-786 (2017) - [j6]Leonardo Lozano
Solving the traveling salesman problem with interdiction and fortification. Oper. Res. Lett. 45(3): 210-216 (2017) - 2016
- [j5]Leonardo Lozano
An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints. Transp. Sci. 50(1): 348-357 (2016) - 2015
- [j4]Daniel Duque, Leonardo Lozano
Solving the Orienteering Problem with Time Windows via the Pulse Framework. Comput. Oper. Res. 54: 168-176 (2015) - [j3]Daniel Duque, Leonardo Lozano
An exact method for the biobjective shortest path problem for large-scale road networks. Eur. J. Oper. Res. 242(3): 788-797 (2015) - 2014
- [j2]Manuel A. Bolívar, Leonardo Lozano
Acceleration strategies for the weight constrained shortest path problem with replenishment. Optim. Lett. 8(8): 2155-2172 (2014) - 2013
- [j1]Leonardo Lozano
On an exact method for the constrained shortest path problem. Comput. Oper. Res. 40(1): 378-384 (2013)
2000 – 2009
- 2009
- [c1]Leonardo Lozano
Generation of Pop-Rock Chord Sequences Using Genetic Algorithms and Variable Neighborhood Search. EvoWorkshops 2009: 573-578
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-07-08 22:25 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: