A hybrid algorithm for the unbounded knapsack problem
暂无分享,去创建一个
[1] Sanjay V. Rajopadhye,et al. Unbounded knapsack problem: Dynamic programming revisited , 2000, Eur. J. Oper. Res..
[2] Peerayuth Charnsethikul,et al. An Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing Time , 2007 .
[3] S. Martello,et al. A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem , 1984 .
[4] Louis Caccetta,et al. Computational aspects of hard Knapsack problems , 2001 .
[5] Fred W. Glover,et al. A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination , 1997, INFORMS J. Comput..
[6] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[7] Nan Zhu,et al. On dominated terms in the general knapsack problem , 1997, Oper. Res. Lett..
[8] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[9] Vincent Poirriez,et al. Unbounded Knapsack Problem: New Results , 1998 .
[10] Hans Kellerer,et al. Knapsack problems , 2004 .
[11] S. Martello,et al. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .
[12] M. Hung,et al. A hard knapsack problem , 1988 .
[13] Egon Balas,et al. Integer Programming , 2021, Encyclopedia of Optimization.
[14] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..