Algorithm 632
swMATH ID:  23775 
Software Authors:  Martello, Silvano; Toth, Paolo 
Description:  Algorithm 632: A program for the 01 multiple knapsack problem. Given n items, each having a profit p j and a weight w j , and m containers (knapsacks), each having a capacity k i , the 01 multiple knapsack problem can be informally described as that of assigning items to the knapsacks such that the total profit of the assigned items is a maximum, the total weight assigned to each knapsack does not exceed its capacity and each item is either assigned to one of the knapsacks or rejected. The paper presents a program to solve the problem through a particular depthfirst treesearch technique making use of a lower bound to determine which branches to follow in the decision tree and an upper bound to limit the number of explored nodes. The program allows one to terminate the execution after a specified number of iterations (backtrackings), getting the best solution currently found. 
Homepage:  https://dl.acm.org/citation.cfm?doid=214392.214397 
Keywords:  branch and bound; 01 multiple knapsack problem; depthfirst treesearch technique 
Related Software:  
Cited in:  3 Publications 
Standard Articles
1 Publication describing the Software, including 1 Publication in zbMATH  Year 

Algorithm 632: A program for the 01 multiple knapsack problem. Zbl 0562.90061 Martello, Silvano; Toth, Paolo 
1985

Cited by 5 Authors
2  Toth, Paolo 
1  Fischetti, Matteo 
1  Lee, TaeEog 
1  Martello, Silvano 
1  Oh, Geun Tae 
Cited in 3 Serials
1  ACM Transactions on Mathematical Software 
1  Operations Research Letters 
1  European Journal of Operational Research 
Cited in 2 Fields
3  Operations research, mathematical programming (90XX) 
2  Numerical analysis (65XX) 