A heuristic solution procedure for the multiconstraint zero‐one knapsack problem

In this article a new heuristic procedure is proposed. This procedure makes use of surrogate duality in solving multiconstraint knapsack problems. Computational effort involved in the procedure is bounded by a polynomial in the number of variables. Extensive computational testing indicates that the procedure generates good feasible solutions regardless of the problem structure. In 98% of the problems solved, the solution generated by the heuristic was within 1% of the optimal solution. This procedure was also tested against other heuristics and was found to compare favorably.

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

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

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

[4]  A Sequential Approach to the $0 - 1$ Linear Programming Problem , 1976 .

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

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

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

[8]  Hisashi Mine,et al.  A heuristic algorithm for mixed-integer programming problems , 1974 .

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

[10]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

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

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

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

[14]  Stelios H. Zanakis,et al.  Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods , 1977 .

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

[16]  Y. Toyoda.  A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems , 1975 .

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

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

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

[20]  Arthur M. Geoffrion,et al.  An Improved Implicit Enumeration Approach for Integer Programming , 1969, Oper. Res..

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

[22]  Hasan Pirkul,et al.  Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality , 1985, Math. Program..

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

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

[25]  Petersen CliffordC..  A Capital Budgeting Heuristic Algorithm Using Exchange Operations , 1974 .