A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s12532-022-00232-2 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S12532-022-00232-2 / rank | |||
Normal rank | |||
Latest revision as of 19:09, 30 December 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
