Network Relaxations for Combinatorial Bilevel Optimization Under Linear Interactions
Operations Research · 2026-11 · 74 (6) · 3359-3379
DOI: 10.1287/opre.2025.2457 ↗Kurz gefasst
Fachartikel in der Zeitschrift Operations Research, 2026-11. Verfasst von Leonardo Lozano und 2 weiteren Autor:innen. Die Arbeit nennt 52 Literaturangaben.
Abstract (Originalsprache)
A Network View of Bilevel Optimization Many decision problems are inherently hierarchical; a leader acts first while anticipating that a follower will respond optimally. Determining the leader’s best decision is notoriously difficult in areas such as infrastructure design, transportation, and security, especially when decisions are discrete. In “Network Relaxations for Combinatorial Bilevel Optimization under Linear Interactions,” Leonardo Lozano, David Bergman, and Andre Cire introduce a new representation for problems in which leader-follower interactions are captured by linear inequalities involving binary leader decisions. Their approach uses a layered decision-diagram network whose paths encode the leader’s choices and whose terminal values represent the follower’s optimal objective value. The network reveals symmetries, supports strong flow-based formulations, and can be compressed through node aggregation to create tractable approximations. Computational tests on previously unresolved benchmark problems show substantial improvements over leading bilevel solvers, proving optimality for many open instances and pointing to promising directions for future research in the field.
Zitieren
APA
Lozano, L., Bergman, D., & Cire, A. A. (2026). Network Relaxations for Combinatorial Bilevel Optimization Under Linear Interactions. Operations Research, 74(6), 3359-3379. https://doi.org/10.1287/opre.2025.2457
Vancouver
Lozano L, Bergman D, Cire AA. Network Relaxations for Combinatorial Bilevel Optimization Under Linear Interactions. Operations Research. 2026;74(6):3359-3379. doi:10.1287/opre.2025.2457
BibTeX
@article{Lozano2026,
author = {Lozano, Leonardo and Bergman, David and Cire, Andre A.},
title = {Network Relaxations for Combinatorial Bilevel Optimization Under Linear Interactions},
journal = {Operations Research},
year = {2026},
volume = {74},
number = {6},
pages = {3359--3379},
doi = {10.1287/opre.2025.2457}
}
EUVIMED