Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7773205
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8538171648979187
0 references
0.8257133960723877
0 references
0.8215991258621216
0 references
0.8055039644241333
0 references
