A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705)
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 bound algorithm for robust binary optimization with budget uncertainty |
scientific article; zbMATH DE number 7716156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7991560697555542
0 references
0.7842950224876404
0 references
0.7822703123092651
0 references
0.78119957447052
0 references
0.7652835249900818
0 references
