An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Q592470 / rank | |||
| Property / author | |||
| Property / author: Frederico Della Croce / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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
