A Study on the Computational Complexity of the Bilevel Knapsack Problem (Q3192105)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Study on the Computational Complexity of the Bilevel Knapsack Problem |
scientific article |
Statements
A Study on the Computational Complexity of the Bilevel Knapsack Problem (English)
0 references
26 September 2014
0 references
bilevel programming
0 references
knapsack problem
0 references
computational complexity
0 references
polynomial hierarchy
0 references
approximability
0 references
approximation scheme
0 references
