A note on the complexity of the bilevel bottleneck assignment problem
Year of publication: |
2022
|
---|---|
Authors: | Fischer, Dennis ; Muluk, Komal ; Woeginger, Gerhard J. |
Published in: |
4OR : quarterly journal of the Belgian, French and Italian Operations Research Societies. - Berlin : Springer, ISSN 1614-2411, ZDB-ID 2106212-2. - Vol. 20.2022, 4, p. 713-718
|
Subject: | Bilevel programming | Combinatorial optimization | Computational complexity | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Engpass | Bottleneck |
-
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
Kasperski, Adam, (2013)
-
Multi-level bottleneck assignment problems : complexity and sparsity-exploiting formulations
Dokka, Trivikram, (2023)
-
Schirmer, Andreas, (1996)
- More ...
-
A note on the complexity of the bilevel bottleneck assignment problem
Fischer, Dennis, (2021)
-
A faster algorithm for the continuous bilevel knapsack problem
Fischer, Dennis, (2020)
-
The trouble with the second quantifier
Woeginger, Gerhard J., (2021)
- More ...