Li Mingshan, Chen Bibo. An Improvement on the Multi-Branch-and-Bound Algorithm for 0-1 Knapsack Problems[J]. Geomatics and Information Science of Wuhan University, 1995, 20(4): 353-358.
Citation:
Li Mingshan, Chen Bibo. An Improvement on the Multi-Branch-and-Bound Algorithm for 0-1 Knapsack Problems[J]. Geomatics and Information Science of Wuhan University, 1995, 20(4): 353-358.
Li Mingshan, Chen Bibo. An Improvement on the Multi-Branch-and-Bound Algorithm for 0-1 Knapsack Problems[J]. Geomatics and Information Science of Wuhan University, 1995, 20(4): 353-358.
Citation:
Li Mingshan, Chen Bibo. An Improvement on the Multi-Branch-and-Bound Algorithm for 0-1 Knapsack Problems[J]. Geomatics and Information Science of Wuhan University, 1995, 20(4): 353-358.
An Improvement on the Multi-Branch-and-Bound Algorithm for 0-1 Knapsack Problems
This paper has improved on the multi-branch-and-bound algorithm for 0-1 knapsack problems1.The method uses one state space tree to describe the solution space of the problem.A new concept,fictitious knapsack,is given to simplify counting the upper bound function.This improved algorithm can solve 0-1 knapsack problems with more than one knapsack efficiently.
Disclaimer: The English version of this article is automatically generated by Baidu Translation and only for reference. We therefore are not responsible for its reasonableness, correctness and completeness, and will not bear any commercial and legal responsibilities for the relevant consequences arising from the English translation.
DownLoad: