We improve the well-known result presented in Bertsimas and Sim (Math Program B98:49-71, 2003) regarding the computation of optimal solutions of Robust Combinatorial Optimization problems with interval uncertainty in the objective function coefficients. We also extend this improvement to a more general class of Combinatorial Optimization problems with interval uncertainty.
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems / Eduardo Álvarez-Miranda;Ivana Ljubić;Paolo Toth. - In: 4OR. - ISSN 1619-4500. - STAMPA. - 11:(2013), pp. 349-360. [10.1007/s10288-013-0231-6]
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
TOTH, PAOLO
2013
Abstract
We improve the well-known result presented in Bertsimas and Sim (Math Program B98:49-71, 2003) regarding the computation of optimal solutions of Robust Combinatorial Optimization problems with interval uncertainty in the objective function coefficients. We also extend this improvement to a more general class of Combinatorial Optimization problems with interval uncertainty.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
