Showing 1 - 10 of 104
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...
Persistent link: https://www.econbiz.de/10014497495
Persistent link: https://www.econbiz.de/10011372404
Persistent link: https://www.econbiz.de/10011379669
Persistent link: https://www.econbiz.de/10011338331
Persistent link: https://www.econbiz.de/10009755519
Persistent link: https://www.econbiz.de/10009724735
Persistent link: https://www.econbiz.de/10010360786
Persistent link: https://www.econbiz.de/10010223301
Persistent link: https://www.econbiz.de/10010223308
Persistent link: https://www.econbiz.de/10010223316