A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Branch-and-Cut Algorithm for Submodular Interdiction Games |
scientific article; zbMATH DE number 7625894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch-and-Cut Algorithm for Submodular Interdiction Games |
scientific article; zbMATH DE number 7625894 |
Statements
A Branch-and-Cut Algorithm for Submodular Interdiction Games (English)
0 references
1 December 2022
0 references
interdiction games
0 references
submodular optimization
0 references
bilevel optimization
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.8914241194725037
0 references
0.8234338760375977
0 references
0.7992918491363525
0 references
0.7893401384353638
0 references
0.778619110584259
0 references
