arrow
返回

MCS -: A new algorithm for multicriteria optimisation in constraint programming

delete2006-08-22
delete10
PRE
AI
F
F. Le Huédé *
M
Michel Grabisch
C
Christophe Labreuche
P
Pierre Savéant
DOI:10.1007/s10479-006-0064-1delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper we propose a new algorithm called MCS for the search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers a good trade-off between criteria, the MCS algorithm alternates several Branch & Bound searches following diversified search strategies. It is implemented in CP in a dedicated framework and can be specialised for either complete or partial search.
Keyword:
multicriteria optimization
multicriteria decision making
constraint programming

期刊

Annals of Operations Research 封面图
Annals of Operations Research
IF:
4.5
论文数:
8.1K
被引数:
2.1W

机构

暂无机构信息
引用论文

引用论文

ITERATIVE BROADENING
err1992-06-01
err42
PREAI
errGINSBERG, ML; HARVEY, WD
err分享
err收藏
学者 查看更多内容