An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3007634324 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1811.02822 / rank | |||
Normal rank | |||
Latest revision as of 03:08, 19 April 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
