Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality

The multiconstraint 0–1 knapsack problem is encountered when one has to decide how to use a knapsack with multiple resource constraints. Even though the single constraint version of this problem has received a lot of attention, the multiconstraint knapsack problem has been seldom addressed.This paper deals with developing an effective solution procedure for the multiconstraint knapsack problem. Various relaxation of the problem are suggested and theoretical relations between these relaxations are pointed out. Detailed computational experiments are carried out to compare bounds produced by these relaxations. New algorithms for obtaining surrogate bounds are developed and tested. Rules for reducing problem size are suggested and shown to be effective through computational tests. Different separation, branching and bounding rules are compared using an experimental branch and bound code. An efficient branch and bound procedure is developed, tested and compared with two previously developed optimal algorithms. Solution times with the new procedure are found to be considerably lower. This procedure can also be used as a heuristic for large problems by early termination of the search tree. This scheme was tested and found to be very effective.

[1]  G. Ingargiola,et al.  Reduction Algorithm for Zero-One Single Knapsack Problems , 1973 .

[2]  Martin Dyer.  Calculating surrogate constraints , 1980, Math. Program..

[3]  Ronald L. Rardin,et al.  Some relationships between lagrangian and surrogate duality in integer programming , 1979, Math. Program..

[4]  H. Martin Weingartner,et al.  Methods for the Solution of the Multidimensional 0/1 Knapsack Problem , 1967, Operational Research.

[5]  Wei Shih,et al.  A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem , 1979 .

[6]  Harvey M. Salkin,et al.  The knapsack problem: A survey , 1975 .

[7]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[8]  Ellis Horowitz,et al.  Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.

[9]  A. M. Geoffrion.  Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

[10]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[11]  Harvey J. Greenberg,et al.  Surrogate Mathematical Programming , 1970, Oper. Res..

[12]  Bezalel Gavish,et al.  Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem , 1983, JACM.

[13]  Bezalel Gavish,et al.  An Optimal Solution Method for the Multiple Travelling Salesman Problem , 1980 .

[14]  Richard Loulou,et al.  New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem , 1979, Oper. Res..

[15]  David G. Luenberger,et al.  Quasi-Convex Programming , 1968 .

[16]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[17]  S. Martello,et al.  An upper bound for the zero-one knapsack problem and a branch and bound algorithm , 1977 .

[18]  Susan Powell,et al.  Fortran codes for mathematical programming: linear, quadratic and discrete , 1973 .

[19]  F. Glover.  A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[20]  Robert M. Nauss,et al.  An Efficient Algorithm for the 0-1 Knapsack Problem , 1976 .

[21]  A. Victor Cabot,et al.  An Enumeration Algorithm for Knapsack Problems , 1970, Oper. Res..

[22]  A. L. Soyster,et al.  Zero-one programming with many variables and few constraints , 1978 .

[23]  Fred Glover,et al.  Surrogate Constraint Duality in Mathematical Programming , 1975, Oper. Res..

[24]  E. Balas,et al.  Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .

[25]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[26]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[27]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[28]  C. M. Shetty,et al.  Computational results with a branch-and-bound algorithm for the general knapsack problem , 1979 .

[29]  Ludo Gelders,et al.  Langrangean relaxations for a generalised assignments-type problem , 1976 .

[30]  Hasan Pirkul,et al.  ALLOCATION OF DATA BASES AND PROCESSORS IN A DISTRIBUTED COMPUTING SYSTEM. , 1982 .

[31]  Egon Balas,et al.  An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

[32]  Sidney L. Hantler,et al.  An Algorithm for Optimal Route Selection in SNA Networks , 1983, IEEE Trans. Commun..

[33]  Bezalel Gavish,et al.  On obtaining the 'best' multipliers for a lagrangean relaxation for integer programming , 1978, Comput. Oper. Res..

[34]  Mark H. Karwan.  Surrogate constraint duality and extensions in integer programming , 1976 .

[35]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[36]  Harvey J. Greenberg,et al.  The Generalized Penalty-Function/Surrogate Model , 1973, Oper. Res..