.png){kind=icon}
返回
An improved algorithm for solving biobjective integer programs
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-006-0058-z.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that provides access to all Pareto outcomes. Extensive computational tests on instances of the biobjective knapsack problem and a capacitated network routing problem are presented.
Keyword:
MULTIPLE OBJECTIVE PROGRAMS
REFERENCE POINT APPROACH
BOUND ALGORITHM
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
暂无机构信息
引用论文
Public-Private Partnership and Policy Reforms for Effective Agricultural Research, Development, and Training公私伙伴关系与政策改革：促进有效的农业研究、发展与培训
.png){kind=icon}
PREAI
分享收藏
A REFERENCE DIRECTION APPROACH TO MULTIPLE-OBJECTIVE INTEGER LINEAR-PROGRAMMING多目标整数线性规划的参考方向方法
PREAI
分享收藏
查看更多内容