A note on the complexity of the bilevel bottleneck assignment problem (Q2095526)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the complexity of the bilevel bottleneck assignment problem |
scientific article; zbMATH DE number 7618970
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the complexity of the bilevel bottleneck assignment problem |
scientific article; zbMATH DE number 7618970 |
Statements
A note on the complexity of the bilevel bottleneck assignment problem (English)
0 references
17 November 2022
0 references
bilevel programming
0 references
combinatorial optimization
0 references
computational complexity
0 references
0 references
