A study on the computational complexity of the bilevel knapsack problem (Q3192105)
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 study on the computational complexity of the bilevel knapsack problem |
scientific article; zbMATH DE number 6348137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A study on the computational complexity of the bilevel knapsack problem |
scientific article; zbMATH DE number 6348137 |
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
0.9691815972328186
0 references
0.8041713833808899
0 references
0.8030941486358643
0 references
0.8012368679046631
0 references
0.7990771532058716
0 references
