Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/286750 
Year of Publication: 
2021
Citation: 
[Journal:] 4OR [ISSN:] 1614-2411 [Volume:] 20 [Issue:] 4 [Publisher:] Springer [Place:] Berlin, Heidelberg [Year:] 2021 [Pages:] 713-718
Publisher: 
Springer, Berlin, Heidelberg
Abstract: 
We establish the NP-completeness of the variant of the bilevel assignment problem, where the leader and the follower both have bottleneck objective functions and were the follower behaves according to the optimistic rule. This result settles a problem that has been left open by Klinz & Gassner [4OR 7:379–394, 2009].
Subjects: 
Bilevel programming
Combinatorial optimization
Computational complexity
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.