.png){kind=icon}
返回
A review of interactive methods for multiobjective integer and mixed-integer programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2006.02.033.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper makes a review of interactive methods devoted to multiobjective integer and mixed-integer programming (MOIP/MOMIP) problems. The basic concepts concerning the characterization of the non-dominated solution set are first introduced, followed by a remark about non-interactive methods vs. interactive methods. Then, we focus on interactive MOIP/MOMIP methods, including their characterization according to the type of preference information required from the decision maker, the computing process used to determine non-dominated solutions and the interactive protocol used to communicate with the decision maker. We try to draw out some contrasts and similarities of the different types of methods. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
integer programming
multiple objective programming
interactive methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
A method for finding the set of non-dominated vectors for multiple objective integer linear programs一种求多目标整数线性规划非支配向量集的方法
PREAI
分享收藏
查看更多内容