Li Mingshan Zheng Haihong, . A Multi-branch-and-bound Algorithm for 0-1 Knapsack Problems[J]. Geomatics and Information Science of Wuhan University, 1995, 20(1): 83-87.
Citation:
Li Mingshan Zheng Haihong, . A Multi-branch-and-bound Algorithm for 0-1 Knapsack Problems[J]. Geomatics and Information Science of Wuhan University, 1995, 20(1): 83-87.
Li Mingshan Zheng Haihong, . A Multi-branch-and-bound Algorithm for 0-1 Knapsack Problems[J]. Geomatics and Information Science of Wuhan University, 1995, 20(1): 83-87.
Citation:
Li Mingshan Zheng Haihong, . A Multi-branch-and-bound Algorithm for 0-1 Knapsack Problems[J]. Geomatics and Information Science of Wuhan University, 1995, 20(1): 83-87.
A Multi-branch-and-bound Algorithm for 0-1 Knapsack Problems
This paper has extended the general branch-and-bound algorithm and given multibranch-and-bound algorithm.The multi-branch-and-bound 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: