A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems

Open link

Publication date

July 2015

DOI

10.1007/s10288-013-0231-6

Publisher

Springer Science and Business Media LLC

Abstract

none3siWe 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.noneEduardo Álvarez-Miranda;Ivana Ljubić;Paolo TothEduardo Álvarez-Miranda;Ivana Ljubić;Paolo Tot

Extracted data

We use cookies to provide a better user experience.

Data Protection

A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems

Abstract

Extracted data

A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems

Abstract

Extracted data

Related items

Related items