The following pages link to Leonardo Lozano (Q337358):
Displaying 14 items.
- Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
- On an exact method for the constrained shortest path problem (Q339592) (← links)
- Acceleration strategies for the weight constrained shortest path problem with replenishment (Q479240) (← links)
- Solving the traveling salesman problem with interdiction and fortification (Q1728213) (← links)
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs (Q2118082) (← links)
- An exact method for the biobjective shortest path problem for large-scale road networks (Q2630225) (← links)
- A Brief Overview of Interdiction and Robust Optimization (Q3299227) (← links)
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem (Q4604908) (← links)
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
- A Backward Sampling Framework for Interdiction Problems with Fortification (Q5739135) (← links)
- An exact bidirectional pulse algorithm for the constrained shortest path (Q6092654) (← links)
- Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions (Q6121580) (← links)
- Real-time solution of quadratic optimization problems with banded matrices and indicator variables (Q6533362) (← links)
- Network Relaxations for Discrete Bilevel Optimization under Linear Interactions (Q6737968) (← links)
