Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s12532-023-00244-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S12532-023-00244-6 / rank | |||
Normal rank | |||
Latest revision as of 18:05, 30 December 2024
scientific article; zbMATH DE number 7773205
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem |
scientific article; zbMATH DE number 7773205 |
Statements
Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (English)
0 references
2 December 2023
0 references
bilevel optimization
0 references
robust optimization
0 references
knapsack interdiction
0 references
mixed-integer programming
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
