Leonardo Lozano

24 papers B 1Journal 22Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
A Bilevel Optimization Approach for a Class of Combinatorial Problems with Disruptions and Probing.
INFORMS J. Comput.
Leonardo Lozano, Juan Sebastian Borrero
2024 J jnl
Constraint Learning to Define Trust Regions in Optimization over Pre-Trained Predictive Models.
INFORMS J. Comput.
Chenbo Shi, Mohsen Emadikhiav, Leonardo Lozano, David Bergman
2023 J jnl
Optimizing over an Ensemble of Trained Neural Networks.
INFORMS J. Comput.
Keliang Wang, Leonardo Lozano, Carlos Cardonha, David Bergman
2023 J jnl
Optimizing the Expected Maximum of Two Linear Functions Defined on a Multivariate Gaussian Distribution.
INFORMS J. Comput.
David Bergman, Carlos Cardonha, Jason Imbrogno, Leonardo Lozano
2023 J jnl
Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions.
INFORMS J. Comput.
Mehdi Ansari, Juan Sebastian Borrero, Leonardo Lozano
2022 J jnl
A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs.
Math. Program.
Leonardo Lozano, J. Cole Smith
2022 J jnl
Careful! Training Relevance is Real.
CoRR
Chenbo Shi, Mohsen Emadikhiav, Leonardo Lozano, David Bergman
2022 J jnl
Constrained Shortest-Path Reformulations for Discrete Bilevel and Robust Optimization.
CoRR
Leonardo Lozano, David Bergman, André A. Ciré
2021 B conf
A Two-Stage Exact Algorithm for Optimization of Neural Network Ensemble.
CPAIOR
Keliang Wang, Leonardo Lozano, David Bergman, Carlos Cardonha
2021 J jnl
Acceleration techniques for optimization over trained neural network ensembles.
CoRR
Keliang Wang, Leonardo Lozano, Carlos Cardonha, David Bergman
2021 J jnl
Decision Diagram Decomposition for Quadratically Constrained Binary Optimization.
INFORMS J. Comput.
David Bergman, Leonardo Lozano
2021 J jnl
Decision diagram-based integer programming for the paired job scheduling problem.
IISE Trans.
Leonardo Lozano, Michael J. Magazine, George G. Polak
2021 J jnl
Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets.
INFORMS J. Comput.
Juan Sebastian Borrero, Leonardo Lozano
2020 J jnl
An exact bidirectional pulse algorithm for the constrained shortest path.
Networks
Nicolás Cabrera, Andrés L. Medaglia, Leonardo Lozano, Daniel Duque
2020 J jnl
On the Consistent Path Problem.
Oper. Res.
Leonardo Lozano, David Bergman, J. Cole Smith
2017 J jnl
A Backward Sampling Framework for Interdiction Problems with Fortification.
INFORMS J. Comput.
Leonardo Lozano, J. Cole Smith
2017 J jnl
A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem.
Oper. Res.
Leonardo Lozano, J. Cole Smith
2017 J jnl
Solving the traveling salesman problem with interdiction and fortification.
Oper. Res. Lett.
Leonardo Lozano, J. Cole Smith, Mary E. Kurz
2016 J jnl
An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints.
Transp. Sci.
Leonardo Lozano, Daniel Duque, Andrés L. Medaglia
2015 J jnl
An exact method for the biobjective shortest path problem for large-scale road networks.
Eur. J. Oper. Res.
Daniel Duque, Leonardo Lozano, Andrés L. Medaglia
2015 J jnl
Solving the Orienteering Problem with Time Windows via the Pulse Framework.
Comput. Oper. Res.
Daniel Duque, Leonardo Lozano, Andrés L. Medaglia
2014 J jnl
Acceleration strategies for the weight constrained shortest path problem with replenishment.
Optim. Lett.
Manuel A. Bolívar, Leonardo Lozano, Andrés L. Medaglia
2013 J jnl
On an exact method for the constrained shortest path problem.
Comput. Oper. Res.
Leonardo Lozano, Andrés L. Medaglia
2009 — conf
Generation of Pop-Rock Chord Sequences Using Genetic Algorithms and Variable Neighborhood Search.
EvoWorkshops
Leonardo Lozano, Andrés L. Medaglia, Nubia Velasco