.png){kind=icon}
返回
THE BOTTLENECK GENERALIZED ASSIGNMENT PROBLEM
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)E0271-X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The min-max version of the generalized assignment problem is considered. We introduce relaxations and show that they produce, as sub-problems, min-max versions of the multiple-choice knapsack problem and of the 0-1 knapsack problem. It is proved that such problems can be solved exactly in polynomial time. We also introduce approximate algorithms and an exact branch-and-bound produce. Randomly generated test problems involving up to 50000 binary variables are solved exactly in acceptable running times.
Keyword:
ASSIGNMENT
RELAXATION
HEURISTICS
BRANCH-AND-BOUND
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容