Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s12532-023-00244-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4383721625 / rank | |||
Normal rank | |||
Revision as of 09:24, 30 July 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
