The computational complexity of bilevel assignment problems
From MaRDI portal
Publication:976987
DOI10.1007/s10288-009-0098-8zbMath1188.90212OpenAlexW2011996183MaRDI QIDQ976987
Bettina Klinz, Elisabeth Gassner
Publication date: 16 June 2010
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-009-0098-8
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (6)
Exact solution approaches for bilevel assignment problems ⋮ On the complexity of the bilevel minimum spanning tree problem ⋮ A simple greedy heuristic for linear assignment interdiction ⋮ On the complexity of robust bilevel optimization with uncertain follower's objective ⋮ A note on the complexity of the bilevel bottleneck assignment problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bilevel programming: a survey
- Hierarchical optimization: An introduction
- Bilevel and multilevel programming: A bibliography review
- Computational Difficulties of Bilevel Linear Programming
- The polynomial hierarchy and a simple model for competitive analysis
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
This page was built for publication: The computational complexity of bilevel assignment problems