.png){kind=icon}
返回
An interactive approximation algorithm for multi-objective integer programs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2018.04.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We develop an interactive algorithm that approximates the most preferred solution for any multi-objective integer program with a desired level of accuracy, provided that the decision maker's (DM's) preferences are consistent with a nondecreasing quasiconcave value function. Using pairwise comparisons of the DM, we construct convex cones and eliminate the inferior regions that are close to being dominated by the cones in addition to the regions dominated by the cones. The algorithm allows the DM to change the desired level of accuracy during the solution process. We test the performance of the algorithm on a set of multi-objective combinatorial optimization problems. It performs very well in terms of the quality of the solution found, the solution time, and the required preference information. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Multi-objective integer programming
Approximation algorithm
Interactive algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
AN INTERACTIVE PROCEDURE FOR MULTIPLE-OBJECTIVE INTEGER LINEAR-PROGRAMMING PROBLEMS多目标整数线性规划问题的交互式过程
PREAI
分享收藏A review of interactive methods for multiobjective integer and mixed-integer programming多目标整数和混合整数规划的交互式方法综述
OAAI
OAAI分享收藏Multi-objective integer programming: A general approach for generating all non-dominated solutions多目标整数规划: 生成所有非支配解的通用方法OAAI
OAAI分享收藏
查看更多内容