A. Billionnet and E. Soutif, An exact method based on Lagrangian decomposition for the 0???1 quadratic knapsack problem, European Journal of Operational Research, vol.157, issue.3, pp.565-575, 2004.
DOI : 10.1016/S0377-2217(03)00244-3
URL : https://hal.archives-ouvertes.fr/hal-01124918

K. Bretthauer and B. Shetty, The nonlinear knapsack problem ??? algorithms and applications, European Journal of Operational Research, vol.138, issue.3, pp.459-472, 2002.
DOI : 10.1016/S0377-2217(01)00179-5

M. Cooper, A Survey of Methods for Pure Nonlinear Integer Programming, Management Science, vol.27, issue.3, pp.353-361, 1981.
DOI : 10.1287/mnsc.27.3.353

M. Djerdjour, K. Mathur, and H. Salkin, A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem, Operations Research Letters, vol.7, issue.5, pp.253-257, 1988.
DOI : 10.1016/0167-6377(88)90041-7

B. Faaland, An Integer Programming Algorithm for Portfolio Selection, Management Science, vol.20, issue.10, pp.1376-1384, 1974.
DOI : 10.1287/mnsc.20.10.1376

D. Fayard and G. Plateau, Reduction algorithms for single and multiple constraints 0-1 linear programming problems International conference methods of mathematical programming proceedings, 1977.

A. Fréville and S. Hanafi, The Multidimensional 0-1 Knapsack Problem???Bounds and Computational Aspects, Annals of Operations Research, vol.13, issue.1, pp.195-227, 2005.
DOI : 10.1007/s10479-005-3448-8

F. Glover, Improved Linear Integer Programming Formulations of Nonlinear Integer Problems, Management Science, vol.22, issue.4, pp.455-460, 1975.
DOI : 10.1287/mnsc.22.4.455

F. Glover, Surrogate Constraint Duality in Mathematical Programming, Operations Research, vol.23, issue.3, pp.434-451, 1975.
DOI : 10.1287/opre.23.3.434

F. Körner, Integer quadratic optimization, European Journal of Operational Research, vol.19, issue.2, pp.268-273, 1985.
DOI : 10.1016/0377-2217(85)90181-X

F. Körner, On the numerical realization of the exact penalty method for quadratic programming algorithms, European Journal of Operational Research, vol.46, issue.3, pp.404-408, 1990.
DOI : 10.1016/0377-2217(90)90017-6

G. S. Lueker, Two np-complete problems in nonnegative integer programming, p.178, 1975.

S. Martello and P. Toth, Knapsack problems: algorithms and computer implementations, 1983.

K. Mathur and H. Salkin, A branch and search algorithm for a class of nonlinear knapsack problems, Operations Research Letters, vol.2, issue.4, pp.155-160, 1983.
DOI : 10.1016/0167-6377(83)90047-0

D. Pisinger, A. Rasmussen, and R. Sandvick, Solution of large quadratic knapsack problems through agressive reduction, INFROMS Journal on Computing, vol.19, issue.2, 2007.

D. Quadri, E. Soutif, and P. Tolla, Upper bounds for large scale integer quadratic multidimensional knapsack problems, International Journal of Operations Research, 2007.
DOI : 10.1007/s10878-007-9105-1
URL : https://hal.archives-ouvertes.fr/hal-01125307