An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 18:36, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact approach for the bilevel knapsack problem with interdiction constraints and extensions |
scientific article |
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
