The computational complexity of bilevel assignment problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6118218 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1163110 (Why is no real title available?)
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel and multilevel programming: A bibliography review
- Bilevel programming: a survey
- Computational Difficulties of Bilevel Linear Programming
- Hierarchical optimization: An introduction
- New Branch-and-Bound Rules for Linear Bilevel Programming
- The polynomial hierarchy and a simple model for competitive analysis
Cited in
(13)- Exact solution approaches for bilevel assignment problems
- scientific article; zbMATH DE number 1855676 (Why is no real title available?)
- scientific article; zbMATH DE number 2112614 (Why is no real title available?)
- On bilevel machine scheduling problems
- A note on the complexity of the bilevel bottleneck assignment problem
- 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
- Bilevel optimization: theory, algorithms, applications and a bibliography
- ON COMPUTATIONAL COMPLEXITY OF HIERARCHICAL OPTIMIZATION
- A simple greedy heuristic for linear assignment interdiction
- On bilevel minimum and bottleneck spanning tree problems
- scientific article; zbMATH DE number 1146101 (Why is no real title available?)
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)
