An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299)
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: An exact approach for the bilevel knapsack problem with interdiction constraints and extensions |
scientific article; zbMATH DE number 7241655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact approach for the bilevel knapsack problem with interdiction constraints and extensions |
scientific article; zbMATH DE number 7241655 |
Statements
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (English)
0 references
28 August 2020
0 references
bilevel programming
0 references
exact approach
0 references
bilevel knapsack with interdiction constraints
0 references
min-max regret knapsack problem
0 references
0 references
0 references
0.9667055010795592
0 references
0.9469295740127563
0 references
0.8434554934501648
0 references
0.8422319889068604
0 references
0.8337787985801697
0 references
