A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705): Difference between revisions
From MaRDI portal
Latest revision as of 09:37, 2 August 2024
scientific article; zbMATH DE number 7716156
Language | Label | Description | Also known as |
---|---|---|---|
English | A branch and bound algorithm for robust binary optimization with budget uncertainty |
scientific article; zbMATH DE number 7716156 |
Statements
A branch and bound algorithm for robust binary optimization with budget uncertainty (English)
0 references
24 July 2023
0 references
robust optimization
0 references
combinatorial optimization
0 references
mathematical programming
0 references
branch and bound
0 references
computation
0 references
0 references
0 references
0 references
0 references
0 references
0 references