.png){kind=icon}
返回
The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2016.03.035.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a new variant of the full 2-split algorithm, the Quadrant Shrinking Method (QSM), for finding all nondominated points of a tri-objective integer program. The algorithm is easy to implement and solves at most 3 vertical bar Y-N vertical bar +1 single-objective integer programs when computing the nondominated frontier, where Y-N is the set of all nondominated points. A computational study demonstrates the efficacy of QSM. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Tri-objective integer programs
Quadrant shrinking method
Criterion space search method
Nondominated frontier
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case混合0-1线性规划的多目标分支和界限: 对双目标情况的修正和改进
.png){kind=icon}
PREAI
分享收藏
A method for finding the set of non-dominated vectors for multiple objective integer linear programs一种求多目标整数线性规划非支配向量集的方法
PREAI
分享收藏
查看更多内容