Bilevel programming with knapsack constraints (Q5949871)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1678792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bilevel programming with knapsack constraints |
scientific article; zbMATH DE number 1678792 |
Statements
Bilevel programming with knapsack constraints (English)
0 references
5 December 2001
0 references
knapsack constraints
0 references
bilevel programming problems
0 references
polynomial approximate algorithm
0 references
0.8642730712890625
0 references
0.8443700075149536
0 references
0.8433845043182373
0 references
0.8207772970199585
0 references
0.8159576654434204
0 references
