.png){kind=icon}
返回
Effective algorithm and heuristic for the generalized assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00710-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present new Branch-and-Bound algorithm for the generalized assignment problem. A standard subgradient method (SM), used at each node of the decision tree to solve the Lagrangian dual, provides an upper bound. Our key contribution in this paper is a new heuristic, applied at each iteration of the SM, which tries to exploit the solution of the relaxed problem, by solving a smaller generalized assignment problem. The feasible solution found is then subjected to a solution improvement heuristic. We consider processing the root node as a Lagrangian heuristic. Computational comparisons are made with new existing methods. (C) 2002 Elsevier B.V. All rights reserved.
Keyword:
branch-and-bound
generalized assignment
knapsack
solution improvement heuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏Organocatalyzed atom transfer radical polymerization driven by visible light可见光驱动的有机催化原子转移自由基聚合.png)
Science
OAAI
ScienceIF0
OAAI分享收藏分享收藏Effect of calcination temperature on the properties of CZTS absorber layer prepared by RF sputtering for solar cell applications煅烧温度对射频溅射制备的CZTS吸收层性能的影响
OAAI
OAAI分享收藏
查看更多内容