Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets

Chassein, André and Goerigk, Marc (2017) Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets. European Journal of Operational Research, 258 (1). pp. 58-69. ISSN 0377-2217

[img]
Preview
PDF (source)
source.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.

Download (485kB)

Abstract

We consider robust counterparts of uncertain combinatorial optimization problems, where the difference to the best possible solution over all scenarios is to be minimized. Such minmax regret problems are typically harder to solve than their nominal, non-robust counterparts. While current literature almost exclusively focuses on simple uncertainty sets that are either finite or hyperboxes, we consider problems with more flexible and realistic ellipsoidal uncertainty sets. We present complexity results for the unconstrained combinatorial optimization problem, the shortest path problem, and the minimum spanning tree problem. To solve such problems, two types of cuts are introduced, and compared in a computational experiment.

Item Type:
Journal Article
Journal or Publication Title:
European Journal of Operational Research
Additional Information:
This is the author’s version of a work that was accepted for publication in European Journal of Operational Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Operational Research, 258, 1, 2017 DOI: 10.1016/j.ejor.2016.10.055
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1800/1802
Subjects:
ID Code:
82586
Deposited By:
Deposited On:
03 Nov 2016 09:04
Refereed?:
Yes
Published?:
Published
Last Modified:
03 Apr 2020 03:42