On the complexity of robust bilevel optimization with uncertain follower's objective
From MaRDI portal
Publication:2060358
DOI10.1016/j.orl.2021.07.009OpenAlexW3161399930MaRDI QIDQ2060358
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
Publication date: 13 December 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.08378
Related Items
The stochastic bilevel continuous knapsack problem with uncertain follower's objective, Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem, A survey on bilevel optimization under uncertainty
Cites Work
- Unnamed Item
- Robust combinatorial optimization under convex and discrete cost uncertainty
- The computational complexity of bilevel assignment problems
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
- The polynomial-time hierarchy
- Bilevel and multilevel programming: A bibliography review
- Multilevel decision-making: a survey
- Robust optimization-methodology and applications
- A robust approach for modeling limited observability in bilevel optimization
- An overview of bilevel optimization
- The polynomial hierarchy and a simple model for competitive analysis
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel Programming Problems