On the complexity of a class of combinatorial optimization problems with uncertainty

• 1 April 2001
• journal article
• research article
• Published by Springer Nature in Mathematical Programming
• Vol. 90  (2) , 263-272
• https://doi.org/10.1007/pl00011424

Abstract

Keywords

• KEY WORDS: POLYNOMIAL ALGORITHM – COMPLEXITY – ROBUST OPTIMIZATION