.png){kind=icon}
返回
The multidimensional 0-1 knapsack problem:: An overview
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(03)00274-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The multidimensional 0-1 knapsack problem is one of the most well-known integer programming problems and has received wide attention from the operational research community during the last four decades. Although recent advances have made possible the solution of medium size instances, solving this NP-hard problem remains a very interesting challenge, especially when the number of constraints increases. This paper surveys the main results published in the literature. The focus is on the theoretical properties as well as approximate or exact solutions of this special 0-1 program. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
multidimensional 0-1 knapsack problem
heuristics
probabilistic and worst-case analysis
surrogate duality
preprocessing
branch-and-bound algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容