A note on the complexity of the bilevel bottleneck assignment problem

DOI10.1007/s10288-021-00499-6OpenAlexW4205372601MaRDI QIDQ2095526

Komal Muluk, Dennis Fischer, Gerhard J. Woeginger

Publication date: 17 November 2022

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-021-00499-6

zbMATH Keywords

computational complexitycombinatorial optimizationbilevel programming

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Bilevel programming: a survey
• The computational complexity of bilevel assignment problems
• Foundations of bilevel programming
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• The NP-completeness column: An ongoing guide
• Bilevel Programming: The Montreal School
• Unnamed Item
• Unnamed Item