An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem

European Journal of Operational Research

Volumn 157, Issue 3, 2004, Pages 565-575

  Billionnet, Alain ^a   Soutif, Éric ^b  

^a IIE   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

0 1 quadratic programming; Branch and bound; Computational results; Knapsack; Lagrangian decomposition

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; LINEAR SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

COMPUTATIONAL RESULTS; LAGRANGIAN DECOMPOSITION; LINEAR CAPACITY; QUADRATIC KNAPSACK PROBLEMS (QKP);

OPERATIONS RESEARCH;

EID: 2342629965     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00244-3     Document Type: Article

References (8)

1. Billionnet A., Calmels F. Linear programming for the 0-1 quadratic knapsack problem. European Journal of Operational Research. 92:1996;310-325.
2. Billionnet A., Faye A., Soutif E. A new upper bound for the 0-1 quadratic knapsack problem. European Journal of Operational Research. 112:1999;664-672.
3. Caprara A., Pisinger D., Toth P. Exact solution of the quadratic knapsack problem. INFORMS Journal on Computing. 11:1999;125-137.
4. Chaillou P., Hansen P., Mahieu Y. Best Network Flow Bound for the Quadratic Knapsack Problem. Lecture Notes in Mathematics. Vol. 1403:1986;. pp. 226-235.
5. Chardaire P., Sutter A. A decomposition method for quadratic zero-one programming. Management Science. 41:1995;704-712.
6. Gallo G., Hammer P.L., Simeone B. Quadratic knapsack problems. Mathematical Programming Study. 12:1980;132-149.
7. Hammer P.L., Rader D.J. Jr. Efficient methods for solving quadratic 0-1 knapsack problems. INFOR. 35:1997;170-182.
8. Michelon P., Veuilleux L. Lagrangean methods for the 0-1 quadratic knapsack problem. European Journal of Operational Research. 92:1996;326-341.