Generation of Pop-Rock Chord Sequences Using Genetic Algorithms and Variable Neighborhood Search. - Leonardo Lozano; Andrés L. Medaglia; Nubia Velasco (EvoWorkshops, 2009)

On an exact method for the constrained shortest path problem. - Leonardo Lozano; Andrés L. Medaglia (Comput. Oper. Res., 2013)

Acceleration strategies for the weight constrained shortest path problem with replenishment. - Manuel A. Bolívar; Leonardo Lozano; Andrés L. Medaglia (Optim. Lett., 2014)

Solving the Orienteering Problem with Time Windows via the Pulse Framework. - Daniel Duque; Leonardo Lozano; Andrés L. Medaglia (Comput. Oper. Res., 2015)

An exact method for the biobjective shortest path problem for large-scale road networks. - Daniel Duque; Leonardo Lozano; Andrés L. Medaglia (Eur. J. Oper. Res., 2015)

An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints. - Leonardo Lozano; Daniel Duque; Andrés L. Medaglia (Transp. Sci., 2016)

A Backward Sampling Framework for Interdiction Problems with Fortification. - Leonardo Lozano; J. Cole Smith (INFORMS J. Comput., 2017)

A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem. - Leonardo Lozano; J. Cole Smith (Oper. Res., 2017)

Solving the traveling salesman problem with interdiction and fortification. - Leonardo Lozano; J. Cole Smith; Mary E. Kurz (Oper. Res. Lett., 2017)

On the Consistent Path Problem. - Leonardo Lozano; David Bergman; J. Cole Smith (Oper. Res., 2020)

An exact bidirectional pulse algorithm for the constrained shortest path. - Nicolás Cabrera; Andrés L. Medaglia; Leonardo Lozano; Daniel Duque (Networks, 2020)

A Two-Stage Exact Algorithm for Optimization of Neural Network Ensemble. - Keliang Wang; Leonardo Lozano; David Bergman; Carlos Cardonha (CPAIOR, 2021)

Acceleration techniques for optimization over trained neural network ensembles. - Keliang Wang; Leonardo Lozano; Carlos Cardonha; David Bergman (CoRR, 2021)

Decision diagram-based integer programming for the paired job scheduling problem. - Leonardo Lozano; Michael J. Magazine; George G. Polak (IISE Trans., 2021)

Decision Diagram Decomposition for Quadratically Constrained Binary Optimization. - David Bergman; Leonardo Lozano (INFORMS J. Comput., 2021)

Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets. - Juan Sebastian Borrero; Leonardo Lozano (INFORMS J. Comput., 2021)

Careful! Training Relevance is Real. - Chenbo Shi; Mohsen Emadikhiav; Leonardo Lozano; David Bergman (CoRR, 2022)

Constrained Shortest-Path Reformulations for Discrete Bilevel and Robust Optimization. - Leonardo Lozano; David Bergman; André A. Ciré (CoRR, 2022)

A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs. - Leonardo Lozano; J. Cole Smith (Math. Program., 2022)

Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions. - Mehdi Ansari; Juan Sebastian Borrero; Leonardo Lozano (INFORMS J. Comput., 2023)

Optimizing the Expected Maximum of Two Linear Functions Defined on a Multivariate Gaussian Distribution. - David Bergman; Carlos Cardonha; Jason Imbrogno; Leonardo Lozano (INFORMS J. Comput., 2023)

Optimizing over an Ensemble of Trained Neural Networks. - Keliang Wang; Leonardo Lozano; Carlos Cardonha; David Bergman (INFORMS J. Comput., 2023)

Constraint Learning to Define Trust Regions in Optimization over Pre-Trained Predictive Models. - Chenbo Shi; Mohsen Emadikhiav; Leonardo Lozano; David Bergman (INFORMS J. Comput., 2024)