A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems (Q2441360): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q181212 |
Normalize DOI. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10288-013-0231-6 / rank | |||
Property / author | |||
Property / author: Paolo Toth / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10288-013-0231-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2163551942 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Robust discrete optimization and network flows / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10288-013-0231-6 / rank | |||
Normal rank |
Latest revision as of 16:00, 18 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems |
scientific article |
Statements
A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems (English)
0 references
24 March 2014
0 references
robust combinatorial optimization problems
0 references
Bertsimas \& Sim algorithm
0 references