.png){kind=icon}
返回
Bound sets for biobjective combinatorial optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2005.10.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we introduce the concept of bound sets for multiobjective discrete optimization. We prove general results on lower and upper bound sets for combinatorial optimization problems with multiple objectives. We present general algorithms for constructing lower and upper bound sets for biobjective problems and provide numerical results on five different problem types. (c) 2005 Elsevier Ltd. All rights reserved.
Keyword:
multiobjective discrete optimization
lower bound
upper bound
heuristics
relaxation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Intrapopulation Differentiation in Annual Plants. III. The Contrasting Effects of Intra- and Interspecific Competition.png)
Evolution
EvolutionIF0
PREAI
分享收藏
分享收藏A branch and bound algorithm for mixed zero-one multiple objective Linear programming零一多目标混合线性规划的分支定界算法
PREAI
分享收藏
查看更多内容