Where are the hard knapsack problems?
暂无分享,去创建一个
[1] Paolo Toth,et al. Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems , 1997, Oper. Res..
[2] David Pisinger,et al. An expanding-core algorithm for the exact 0-1 knapsack problem , 1995 .
[3] David Pisinger,et al. Linear Time Algorithms for Knapsack Problems with Bounded Weights , 1999, J. Algorithms.
[4] Pascal Koiran,et al. Are Lower Bounds Easier over theReals ? , 1998 .
[5] S. Martello,et al. A New Algorithm for the 0-1 Knapsack Problem , 1988 .
[6] Robert Weismantel,et al. On the 0/1 knapsack polytope , 1997, Math. Program..
[7] David Pisinger,et al. Dynamic Programming on the Word RAM , 2003, Algorithmica.
[8] S. Martello,et al. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .
[9] David Pisinger,et al. A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..
[10] David Pisinger,et al. Core Problems in Knapsack Algorithms , 1999, Oper. Res..
[11] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[12] Sean R Eddy,et al. What is dynamic programming? , 2004, Nature Biotechnology.
[13] Paolo Toth,et al. New trends in exact algorithms for the 0-1 knapsack problem , 2000, Eur. J. Oper. Res..
[14] F. Heide. A polynomial linear search algorithm for the n-dimensional knapsack problem , 1983, STOC.
[15] Egon Balas,et al. An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..