Leonardo Lozano

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 17

Top Topics

Traveling Salesman

Integer Programming

Trained Neural Networks

Top Venues

INFORMS J. Comput.

Oper. Res. Lett.

Publications

Keliang Wang, Leonardo Lozano, Carlos Cardonha, David Bergman
Optimizing over an Ensemble of Trained Neural Networks. INFORMS J. Comput. 35 (3) (2023)
Mehdi Ansari, Juan Sebastian Borrero, Leonardo Lozano
Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions. INFORMS J. Comput. 35 (1) (2023)
David Bergman, Carlos Cardonha, Jason Imbrogno, Leonardo Lozano
Optimizing the Expected Maximum of Two Linear Functions Defined on a Multivariate Gaussian Distribution. INFORMS J. Comput. 35 (2) (2023)
Leonardo Lozano, J. Cole Smith
A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs. Math. Program. 191 (1) (2022)
Chenbo Shi, Mohsen Emadikhiav, Leonardo Lozano, David Bergman
Careful! Training Relevance is Real. CoRR (2022)
Leonardo Lozano, David Bergman, André A. Ciré
Constrained Shortest-Path Reformulations for Discrete Bilevel and Robust Optimization. CoRR (2022)
Keliang Wang, Leonardo Lozano, Carlos Cardonha, David Bergman
Acceleration techniques for optimization over trained neural network ensembles. CoRR (2021)
Leonardo Lozano, Michael J. Magazine, George G. Polak
Decision diagram-based integer programming for the paired job scheduling problem. IISE Trans. 53 (6) (2021)
Juan Sebastian Borrero, Leonardo Lozano
Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets. INFORMS J. Comput. 33 (4) (2021)
Keliang Wang, Leonardo Lozano, David Bergman, Carlos Cardonha
A Two-Stage Exact Algorithm for Optimization of Neural Network Ensemble. CPAIOR (2021)
David Bergman, Leonardo Lozano
Decision Diagram Decomposition for Quadratically Constrained Binary Optimization. INFORMS J. Comput. 33 (1) (2021)
Leonardo Lozano, David Bergman, J. Cole Smith
On the Consistent Path Problem. Oper. Res. 68 (6) (2020)
Nicolás Cabrera, Andrés L. Medaglia, Leonardo Lozano, Daniel Duque
An exact bidirectional pulse algorithm for the constrained shortest path. Networks 76 (2) (2020)
Leonardo Lozano, J. Cole Smith
A Backward Sampling Framework for Interdiction Problems with Fortification. INFORMS J. Comput. 29 (1) (2017)
Leonardo Lozano, J. Cole Smith, Mary E. Kurz
Solving the traveling salesman problem with interdiction and fortification. Oper. Res. Lett. 45 (3) (2017)
Leonardo Lozano, J. Cole Smith
A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem. Oper. Res. 65 (3) (2017)
Leonardo Lozano, Daniel Duque, Andrés L. Medaglia
An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints. Transp. Sci. 50 (1) (2016)
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) (2015)
Daniel Duque, Leonardo Lozano, Andrés L. Medaglia
Solving the Orienteering Problem with Time Windows via the Pulse Framework. Comput. Oper. Res. 54 (2015)
Manuel A. Bolívar, Leonardo Lozano, Andrés L. Medaglia
Acceleration strategies for the weight constrained shortest path problem with replenishment. Optim. Lett. 8 (8) (2014)
Leonardo Lozano, Andrés L. Medaglia
On an exact method for the constrained shortest path problem. Comput. Oper. Res. 40 (1) (2013)
Leonardo Lozano, Andrés L. Medaglia, Nubia Velasco
Generation of Pop-Rock Chord Sequences Using Genetic Algorithms and Variable Neighborhood Search. EvoWorkshops (2009)