A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/ijoc.2022.1196 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/IJOC.2022.1196 / rank | |||
Normal rank | |||
Latest revision as of 15:46, 30 December 2024
scientific article; zbMATH DE number 7625894
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
