A Bound and Bound algorithm for the zero-one multiple knapsack problem

42Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

By the term "Bound and Bound" we define a particular tree-search technique for the ILP, which, for a maximization problem, makes use of a lower bound to determine the branches to follow in the decision tree. This technique is applied to the solution of the Zero-One Multiple Knapsack Problem and an algorithm is derived; an illustrative example of the procedure is provided. We present extensive computational results showing that the method is capable of solving problems up to 4 knapsacks and 200 variables with running times considerably smaller than those of the most commonly utilized algorithms. © 1981.

Cite

CITATION STYLE

APA

Martello, S., & Toth, P. (1981). A Bound and Bound algorithm for the zero-one multiple knapsack problem. Discrete Applied Mathematics, 3(4), 275–288. https://doi.org/10.1016/0166-218X(81)90005-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free