Zichao Shao

Simultaneous Group-Envelope Bounds for $\Gamma$-Robust Multiple-Choice Knapsack Problems

Many robust planning problems are solved by checking a family of ordinary optimization problems, one for each uncertainty threshold. Repeatedly building and solving those relaxations can dominate runtime. We show that, when a decision chooses exactly one option from each group, the entire threshold family of multiple-c...