Showing math.OCShow all
2 papers · 1 filter
math.OC2024
Network Relaxations for Discrete Bilevel Optimization under Linear Interactions
Leonardo Lozano, David Bergman, Andre Augusto Cire
We investigate relaxations for a class of discrete bilevel programs where the interaction constraints linking the leader and the follower are linear. Our approach reformulates the…
math.OC2022
Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
Leonardo Lozano, David Bergman, Andre A. Cire
Many discrete optimization problems are amenable to constrained shortest-path reformulations in an extended network space, a technique that has been key in convexification, bound s…