期刊
OPERATIONS RESEARCH LETTERS
卷 43, 期 1, 页码 1-6出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2014.10.003
关键词
Multi-objective optimization; Pareto set; Non-dominated points; Approximation algorithm; Greedy algorithm
资金
- French ANR project GUaranteed Efficiency for PAReto optimal solutions Determination (GUEPARD) [ANR-09-BLAN-0361]
We are interested in a problem introduced by Vassilvitskii and Yannakakis (2005), the computation of a minimum set of solutions that approximates within an accuracy epsilon the Pareto set of a multi-objective optimization problem. We mainly establish a new 3-approximation algorithm for the bi-objective case. We also propose a study of the greedy algorithm performance for the tri-objective case when the points are given explicitly, answering an open question raised by Koltun and Papadimitriou in (2007). (C) 2014 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据