.png){kind=icon}
返回
Optimizing a linear function over an integer efficient set
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.02.072.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a method for optimizing a linear function over the integer Pareto-optimal set without having to determine all integer efficient solutions is presented. The proposed algorithm is based on a simple selection technique that improves the linear objective value at each iteration. Two types of cuts are performed successively until the optimal value is obtained and the current truncated region contains no integer feasible solution. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
multi-objective optimization
discrete optimization
linear programming
efficient set
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容