A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s12532-022-00232-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4317805267 / rank | |||
Normal rank | |||
Revision as of 09:21, 30 July 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
