# Robust Combinatorial Optimization Problems Under Budgeted Interdiction Uncertainty

arXiv: https://arxiv.org/abs/2307.08525 · HTML: https://mlsanity.com/paper/2307.08525/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Jul 2023.

## Built on by (most cited first, 1 of 1)

- [Robust Optimization Approach and Learning Based Hide-and-Seek Game for Resilient Network Design](https://mlsanity.com/paper/2602.11854/) (2026)

## Abstract (arXiv)

In robust combinatorial optimization, we would like to find a solution that performs well under all realizations of an uncertainty set of possible parameter values. How we model this uncertainty set has a decisive influence on the complexity of the corresponding robust problem. For this reason, budgeted uncertainty sets are often studied, as they enable us to decompose the robust problem into easier subproblems. We propose a variant of discrete budgeted uncertainty for cardinality-based constraints or objectives, where a weight vector is applied to the budget constraint. We show that while the adversarial problem can be solved in linear time, the robust problem becomes NP-hard and not approximable. We discuss different possibilities to model the robust problem and show experimentally that despite the hardness result, some models scale relatively well in the problem size.