The computational complexity of bilevel assignment problems
From MaRDI portal
Publication:976987
DOI10.1007/S10288-009-0098-8zbMATH Open1188.90212OpenAlexW2011996183MaRDI QIDQ976987FDOQ976987
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bilevel and multilevel programming: A bibliography review
- 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
- Title not available (Why is that?)
- Computational Difficulties of Bilevel Linear Programming
- Bilevel programming: a survey
- Hierarchical optimization: An introduction
Cited In (11)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact solution approaches for bilevel assignment problems
- A note on the complexity of the bilevel bottleneck assignment problem
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- On the complexity of the bilevel minimum spanning tree problem
- On the complexity of robust bilevel optimization with uncertain follower's objective
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
- ON COMPUTATIONAL COMPLEXITY OF HIERARCHICAL OPTIMIZATION
- A simple greedy heuristic for linear assignment interdiction
- Title not available (Why is that?)
Recommendations
This page was built for publication: The computational complexity of bilevel assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976987)
