The pricing problem. Part II: Computational complexity (Q5263797)
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: The pricing problem. Part II: Computational complexity |
scientific article; zbMATH DE number 6460032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The pricing problem. Part II: Computational complexity |
scientific article; zbMATH DE number 6460032 |
Statements
The pricing problem. Part II: Computational complexity (English)
0 references
17 July 2015
0 references
computational complexity
0 references
approximability
0 references
bilevel problem
0 references
pricing problem
0 references
approximate algorithm
0 references
approximation class
0 references
NP-hard in the strong sense
0 references
polynomial hierarchy
0 references
0.92829114
0 references
0 references
0 references
0.8778189
0 references
0.8698536
0 references
0.8692885
0 references
0 references
0.8654618
0 references
