Refine
Year of publication
- 2023 (82) (remove)
Document Type
- Doctoral Thesis (39)
- Article (30)
- Contribution to a Periodical (6)
- Working Paper (4)
- Part of Periodical (2)
- Conference Proceedings (1)
Language
- English (54)
- German (27)
- Multiple languages (1)
Has Fulltext
- yes (82)
Keywords
- Deutschland (5)
- Optimierung (5)
- Klima (3)
- Konflikt (3)
- Schule (3)
- Schüler (3)
- Weinbau (3)
- survey statistics (3)
- Analysis (2)
- Anpassung (2)
Institute
- Fachbereich 2 (20)
- Fachbereich 4 (12)
- Politikwissenschaft (7)
- Raum- und Umweltwissenschaften (6)
- Fachbereich 1 (5)
- Fachbereich 6 (5)
- Psychologie (4)
- Fachbereich 3 (3)
- Wirtschaftswissenschaften (2)
- Mathematik (1)
Developing solution methods for discrete bilevel problems is known to be a challenging task—even if all parameters of the problem are exactly known. Many real-world applications of bilevel optimization, however, involve data uncertainty. We study discrete min-max problems with a follower who faces uncertainties regarding the parameters of the lower-level problem. Adopting a Γ-robust approach, we present an extended formulation and a multi-follower formulation to model this type of problem. For both settings, we provide a generic branch-and-cut framework. Specifically, we investigate interdiction problems with a monotone Γ-robust follower and we derive problem-tailored cuts, which extend existing techniques that have been proposed for the deterministic case. For the Γ-robust knapsack interdiction problem, we computationally evaluate and compare the performance of the proposed algorithms for both modeling approaches.