.png){kind=icon}
返回
Solving the generalised assignment problem using polyhedral results
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(97)00054-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Generalised Assignment Problem (GAP) consists of finding a maximal profit assignment of n tasks over in capacity constrained agents, whereby each task has to be processed by only one agent. We develop an improved implementation of the standard procedure for generating lifted cover inequalities describing an approximation to the convex hull of the knapsack constraints in the GAP polytope. This improvement yields a good upper bound and closes the gap by an additional 15% on average. Based on this result, we propose two heuristics for finding close-to-optimal solutions, giving us a tight lower bound. Computational results on a set of 60 representative and highly capacitated problems indicate that these solutions lie within 0.06% of the optimum. After applying some pre-processing techniques and using the obtained bounds, we solve the generated instances to optimality by Branch-and-Bound (B & B) within reasonable computing time. (C) 1998 Elsevier Science B.V.
Keyword:
generalised assignment problem
knapsack polytope
decomposition
integer programming
branch-and-bound
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Delayed rather than decreased BOLD response as a marker for early Alzheimer's disease.png)
NeuroImage
NeuroImageIF0
PREAI
分享收藏分享收藏
查看更多内容