Solution of the zero-one multiple knapsack problem

European Journal of Operational Research - Tập 4 - Trang 276-283 - 1980
Silvano Martello1, Paolo Toth1
1Istituto di Automatica, University of Bologna, Bologna, Italy

Tài liệu tham khảo

Ahrens, 1975, Merging and sorting applied to 0–1 knapsack problem, Operations Res., 23, 1099, 10.1287/opre.23.6.1099 N. Christofides, G. Carpaneto, A. Mingozzi and P. Toth, The loading of liquids into tanks, Management Sci. (to appear). Horowitz, 1974, Computing partitions with applications to the knapsack problem, J. ACM, 21, 277, 10.1145/321812.321823 Hung, 1978, An algorithm for 0–1 multiple knapsack problems, Naval Res. Logist, Quart., 25, 571, 10.1002/nav.3800250316 Ingargiola, 1975, An algorithm for the solution of 0–1 loading problems, Operations Res., 23, 1110, 10.1287/opre.23.6.1110 Martello, 1977, An upper bound for the zero-one knapsack problem and a branch and bound algorithm, Europ. J. Operational Res., 1, 169, 10.1016/0377-2217(77)90024-8