.png){kind=icon}
返回
Some exact algorithms for the knapsack sharing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(97)00165-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The knapsack sharing problem (KSP) is formulated as an extension to the ordinary knapsack problem. The KSP is NP-hard. We present a branch-and-bound algorithm and a binary search algorithm to solve this problem to optimality. These algorithms are implemented and computational experiments are carried out to analyse the behavior of the developed algorithms. As a result, we find that the binary search algorithm solves KSPs with up to 20000 variables in less than a minute in our computing environment. (C) 1998 Elsevier Science B.V.
Keyword:
knapsack sharing problem
combinatorial optimization
binary search method
max-min objective function
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容