基于情景聚合的鲁棒优化问题的逼近
On Scenario Aggregation to Approximate Robust Optimization Problems
摘要:
由于大多数具有离散不确定性集的鲁棒组合极小-极大和极小-极大后悔问题都是NP-难问题,因此对近似算法和可逼近性界的研究是近年来的一个富有成果的领域。一个简单而著名的近似算法是中点法,其中取所有场景的平均值,并解决名义型问题。尽管它的简单性,这种方法仍然给出了最好的知名的范围内的问题,如鲁棒最短路径,或鲁棒分配问题。在本文中,我们提出了一个简单的扩展的中点方法的基础上的场景聚合,它提高了目前最好的$K$ -近似结果的$(\varepsilon K)$ -近似任何所需的$\varepsilon > 0$。我们的方法可以应用到最小-最大以及最小-最大后悔问题。
英文摘要:
As most robust combinatorial min-max and min-max regret problems with discrete uncertainty sets are NP-hard, research into approximation algorithm and approximability bounds has been a fruitful area of recent work. A simple and well-known approximation algorithm is the midpoint method, where one takes the average over all scenarios, and solves a problem of nominal type. Despite its simplicity, this method still gives the best-known bound on a wide range of problems, such as robust shortest path, or robust assignment problems. In this paper we present a simple extension of the midpoint method based on scenario aggregation, which improves the current best $K$-approximation result to an $(\varepsilon K)$-approximation for any desired $\varepsilon > 0$. Our method can be applied to min-max as well as min-max regret problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。