An approximate dynamic programming approach to convex quadratic knapsack problems

Computers and Operations Research

Volumn 33, Issue 3, 2006, Pages 660-673

  Hua, Zhongsheng ^a   Zhang, Bin ^a   Liang, Liang ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Approximate dynamic programming; Heuristics; Quadratic knapsack problem

Indexed keywords

APPROXIMATION THEORY; HEURISTIC METHODS; NUMBER THEORY; OPTIMIZATION; PROBLEM SOLVING; QUADRATIC PROGRAMMING; RELAXATION PROCESSES;

APPROXIMATE DYNAMIC PROGRAMMING; FUNCTION VALUE; HEURISTICS; QUADRATIC KNAPSACK PROBLEMS (QKP);

DYNAMIC PROGRAMMING;

EID: 23344431534     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.07.012     Document Type: Article

References (28)

1. P.L. Hammer, P. Hansen, and B. Simeone Roof duality, complementation and persistency in quadratic 0-1 optimization Mathematical Programming 28 1984 121 155
2. D.J. Laughhunn Quadratic binary programming with application to capital-budgeting problems Operations Research 18 1970 454 461
3. G. Gallo, P.L. Hammer, and B. Simeone Quadratic knapsack problems Mathematical programming 12 1980 132 149
4. E.L. Johnson, A. Mehrotra, and G.L. Nemhauser Min-cut clustering Mathematical Programming 62 1993 133 151
5. Z.S. Hua, and P. Banerjee Aggregate line capacity design for PWB assembly systems International Journal of Production Research 38 2000 2417 2441
6. S. Martello, and P. Toth Knapsack problems algorithms and computer implementations 1990 Wiley Chichester, UK
7. Kellerer H, Pferschy U, Pisinger D. Knapsack problems. Berlin: Springer; 2004. pp. 349-88.
8. McCallum CJ. An algorithm for certain quadratic integer programs. Technical report, Bell Laboratories, Holmdel, NJ, Undated.
9. K. Mathur, and H.M. Salkin A branch and search algorithm for a class of nonlinear knapsack problems Operations Research Letters 2 1983 155 160
10. M. Djerdjour, K. Mathur, and H.M. Salkin A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem Operations Research Letters 7 1988 253 258
11. C.E. Ferreira, A. Martin, C. DeSouza, R. Weismantel, and L. Wolsey Formulations and valid inequalities for the node capacitated graph partitioning problem Mathematical Programming 74 1996 247 267
12. C. Helmberg, F. Rendl, and R. Weismantel A semidefinite programming approach to the quadratic knapsack problem Journal of Combinatorial Optimization 4 2000 197 215
13. R.E. Bellman Dynamic programming 1975 Princeton University Press Princeton, NJ
14. T.L. Morin Dynamic programming and its applications M.L. Puterman Computational advances in dynamic programming 1978 Academic Press NY 53 90
15. L. Cooper, and M.W. Cooper Introduction to dynamic programming 1981 Pergamon Press Elmsford, NY
16. D. Bertsimas, and R. Demir An approximate dynamic programming approach to multidimensional knapsack problems Management Science 48 2002 550 565
17. Billionnet A. Maximizing a tree-structured pseudo-Boolean function with a cardinality constraint. International colloquium on graphs and optimization, Grimentz, Suisse, 23-28 août 1992.
18. D.J. Rader Jr, and G.J. Woeginger The quadratic 0-1 knapsack problem with series-parallel support Operations Research Letters 30 2002 159 166
19. A. Billionnet Approximation algorithms for fractional knapsack problems Operations Research Letters 30 2002 336 342
20. A. Caprara, D. Pisinger, and P. Toth Exact solution of the quadratic knapsack problem INFORMS Journal on Computing 11 1999 125 137
21. Forrester RJ. Addressing formulation size, strength, and mathematical structure in modeling discrete decision problems. PhD thesis, The graduate school of Clemson university, 2002. pp. 81-98.
22. K.M. Bretthauer, B. Shetty, and S. Syam A branch-and-bound algorithm for integer quadratic knapsack problems ORSA Journal on Computing 7 1995 109 116
23. K.M. Bretthauer, and B. Shetty The nonlinear knapsack problem-algorithms and applications European Journal of Operational Research 138 2002 459 472
24. D.S. Hochbaum The nonlinear knapsack problem Operational Research Letters 17 1995 103 110
25. Hua ZS, Zhang B, Liang L. A reduced-cost fixing condition for convex integer quadratic programs. Information Processing Letters, 2004, submitted for publication.
26. C.E. Lemke Bimarix equilibrium points and mathematical programming Management Science 11 1965 681 689
27. D. Bertsimas, and R. Shioda Restaurant revenue management Operations Research 51 3 2003 472 486
28. A.E. Brouwer, A.M. Cohen, and A. Neumaier Distance regular graphs 1989 Springer New York