Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
Authors:
- André ChasseinACAndré Chassein
- Marc GoerigkMGMarc Goerigk
- 1 April 2017
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 258 (1) , 58-69
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Theory and Applications of Robust OptimizationSIAM Review, 2011
- Min–max and min–max regret versions of combinatorial optimization problems: A surveyEuropean Journal of Operational Research, 2009
- Approximation of min–max and min–max regret versions of some combinatorial optimization problemsEuropean Journal of Operational Research, 2007
- Complexity of the min–max and min–max regret assignment problemsOperations Research Letters, 2005
- On the complexity of minmax regret linear programmingEuropean Journal of Operational Research, 2005
- Interval data minmax regret network optimization problemsDiscrete Applied Mathematics, 2004
- The Price of RobustnessOperations Research, 2004
- On the complexity of a class of combinatorial optimization problems with uncertaintyMathematical Programming, 2001
- Robust solutions of uncertain linear programsOperations Research Letters, 1999
- Robust Convex OptimizationMathematics of Operations Research, 1998