A Multi-branch-and-bound Algorithm for 0-1 Knapsack Problems

Li Mingshan Zheng Haihong

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.

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

Li Mingshan Zheng Haihong,

Graphical Abstract

Abstract

Abstract

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.

FullText(HTML)

References (0)

Cited By

A Multi-branch-and-bound Algorithm for 0-1 Knapsack Problems

Abstract

Catalog

Export File

Citation

Format

Content