An Algorithm for the 0-1 Equality Knapsack Problem
暂无分享,去创建一个
[1] G. Ingargiola,et al. Reduction Algorithm for Zero-One Single Knapsack Problems , 1973 .
[2] Egon Balas,et al. An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..
[3] Jonathan S. Yormark. Accelerating Greenberg's metho̧d for the computation of knapsack functions , 1975 .
[4] G. Nemhauser,et al. Integer Programming , 2020 .
[5] H. Greenberg,et al. A Branch Search Algorithm for the Knapsack Problem , 1970 .
[6] S. Martello,et al. An upper bound for the zero-one knapsack problem and a branch and bound algorithm , 1977 .
[7] M. Karwan,et al. Aggregation of constraints in integer programming , 1988 .
[8] Ellis Horowitz,et al. Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.
[9] Robert M. Nauss,et al. An Efficient Algorithm for the 0-1 Knapsack Problem , 1976 .
[10] Marion Lauriere. An algorithm for the 0/1 Knapsack problem , 1978, Math. Program..
[11] F. Plastria,et al. The zero-one knapsack problem with equality constraint , 1985 .