A note on the complexity of the bilevel bottleneck assignment problem
Keyword(s):
AbstractWe 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].
2004 ◽
Vol 17
◽
pp. 35-40
◽
Keyword(s):
1977 ◽
Vol 21
(4)
◽
pp. 451-458
◽
2011 ◽
Vol 36
(2)
◽
pp. 205-226
◽
1982 ◽
Vol 36
(1)
◽
pp. 135-138
◽
2013 ◽
Vol 13
(6)
◽
pp. 211-220
2016 ◽
Vol 14
(2)
◽
pp. 125