arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1606.01180math.OC
收藏

椭球不确定集上的Min-Max遗憾问题

Min-Max Regret Problems with Ellipsoidal Uncertainty Sets

A. Chassein, M. Goerigk

摘要:

我们认为强大的不确定性组合最优化问题,在所有情况下的最佳可能的解决方案的差异是最小化。这样的极小极大后悔问题通常比名义上的、非鲁棒的问题更难解决。虽然目前的文献几乎完全集中在简单的不确定性集,无论是有限的或超盒,我们认为更灵活和现实的椭球不确定性集的问题。我们目前的无约束组合最优化问题和最短路问题的复杂性结果。为了解决这些问题,两种类型的削减,并在计算实验中进行了比较。

英文摘要:

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 and for the shortest path problem. To solve such problems, two types of cuts are introduced, and compared in a computational experiment.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑