.png){kind=icon}
返回
The min-conflict packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.10.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the classical bin-packing problem with conflicts (BPC), the goal is to minimize the number of bins used to pack a set of items subject to disjunction constraints. In this paper, we study a new version of BPC: the min-conflict packing problem (MCBP), in which we minimize the number of violated conflicts when the number of bins is fixed. In order to find a tradeoff between the number of bins used and the violation of the conflict constraints, we also consider a bi-objective version of this problem. We show that the special structure of its Pareto front allows to reformulate the problem as a small set of MCBP. We solved these two problems through heuristics, column-generation methods, and a tabu search. Computational experiments are reported to assess the quality of our methods. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Bin packing with conflicts
Knapsack problem
Column generation
Multi-objective optimization
Tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Conformational change and protein–protein interactions of the fusion protein of Semliki Forest virusSemliki森林病毒融合蛋白的构象变化和蛋白-蛋白相互作用.png)
Nature
NatureIF0
PREAI
分享收藏MINIMIZING CONFLICTS - A HEURISTIC REPAIR METHOD FOR CONSTRAINT SATISFACTION AND SCHEDULING PROBLEMS
OAAI
OAAI分享收藏
查看更多内容