R. Andonov, V. Poirriez, and S. Rajopadhye, Unbounded knapsack problem: Dynamic programming revisited, European Journal of Operational Research, vol.123, issue.2, pp.168-181, 2000.
DOI : 10.1016/S0377-2217(99)00265-9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

D. Babayev, F. Glover, and J. Ryan, A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination, INFORMS Journal on Computing, vol.9, issue.1, pp.43-50, 1997.
DOI : 10.1287/ijoc.9.1.43

V. Boyer, M. Elkihel, and D. Baz, Efficient heuristics for the 0/1 multidimensional knapsack, ROADEF, pp.95-106, 2006.

L. Caccetta and A. Kulanoot, Computational aspects of hard Knapsack problems, Nonlinear Analysis: Theory, Methods & Applications, vol.47, issue.8, pp.5547-5558, 2001.
DOI : 10.1016/S0362-546X(01)00658-7

C. Chung, M. S. Hung, and W. O. Rom, A hard knapsack problem, Naval Research Logistics, vol.6, issue.1, pp.85-98, 1988.
DOI : 10.1002/1520-6750(198802)35:1<85::AID-NAV3220350108>3.0.CO;2-D

R. Garfinkel and G. Nemhauser, Integer Programming, 1972.

P. C. Gilmore and R. E. Gomory, The Theory and Computation of Knapsack Functions, Operations Research, vol.14, issue.6, pp.1045-1074, 1966.
DOI : 10.1287/opre.14.6.1045

S. Martello, D. Pisinger, and P. Toth, Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem, Management Science, vol.45, issue.3, pp.414-424, 1999.
DOI : 10.1287/mnsc.45.3.414

S. Martello and P. Toth, A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem, Management Science, vol.30, issue.6, pp.765-771, 1984.
DOI : 10.1287/mnsc.30.6.765

S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, 1990.

G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, 1988.
DOI : 10.1002/9781118627372

URL : http://dx.doi.org/10.1016/s0898-1221(99)91259-2

U. Pferschy, H. Kellerer, and D. Pisinger, Knapsack Problems, 2004.

G. Plateau and M. Elkihel, A hybrid algorithm for the 0-1 knapsack problem, Methods of Oper. Res, vol.49, pp.277-293, 1985.

V. Poirriez and R. Andonov, Unbounded Knapsack Problem: New Results, Workshop Algorithms and Experiments (ALEX98), pp.103-111, 1998.

V. Poirriez, N. Yanev, and R. Andonov, Towards reduction of the class of intractable unbounded knapsack problem, 2004.

C. Srisuwannapa and P. Charnsethikul, An exact algorithm for the unbounded knapsack problem with minimizing maximum processing time, Journal of Computer Science, vol.3, issue.3, pp.138-143, 2007.

N. Zhu and K. Broughan, On dominated terms in the general knapsack problem, Operations Research Letters, vol.21, issue.1, pp.31-37, 1997.
DOI : 10.1016/S0167-6377(97)00018-7