Network Relaxations for Combinatorial Bilevel Optimization Under Linear Interactions
A new representation for problems in which leader-follower interactions are captured by linear inequalities involving binary leader decisions is introduced, which uses a layered decision-diagram network whose paths encode the leader’s choices and whose terminal values represent the follower’s optimal objective value.