Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems

Journal of Optimization Theory and Applications

Volumn 151, Issue 2, 2011, Pages 241-259

  Wu, Z Y ^a   Yang, Y J ^b   Bai, F S ^a   Mammadov, M ^a  

^a UNIVERSITY OF BALLARAT   (Australia)

^b SHANGHAI UNIVERSITY   (China)

Author keywords

Global optimality conditions; Global optimization method; Local optimization method; Quadratic knapsack problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; GLOBAL OPTIMIZATION;

AUXILIARY FUNCTIONS; CONDITION; GLOBAL OPTIMALITY CONDITIONS; GLOBAL OPTIMIZATION METHOD; LINEAR CAPACITY CONSTRAINTS; LOCAL OPTIMIZATION METHODS; OPTIMIZATION METHOD; QUADRATIC KNAPSACK PROBLEMS; QUADRATIC OBJECTIVE FUNCTIONS; SIMPLE STRUCTURES;

NUMERICAL METHODS;

EID: 80255124877     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-011-9885-4     Document Type: Article

References (22)

1. Gallo, G., Hammer, P. L., Simeone, B.: Quadratic knapsack problems. Math. Program. 12, 132-149 (1980).
2. Pisinger, D.: The quadratic knapsack problem-a survey. Discrete Appl. Math. 155, 623-648 (2007).
3. Witzgall, C.: Mathematical methods of site selection for electronic message system (EMS). Technical Report, NBS Internal Report (1975).
4. Rhys, J.: A selection problem of shared fixed costs and network flows. Manag. Sci. 17, 200-207 (1970).
5. Johnson, E., Mehrotra, A., Nemhauser, G.: Min-cut clustering. Math. Program. 62, 133-152 (1993).
6. Billionnet, A., Faye, A., Soutif, E.: A new upper bound for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 112, 664-672 (1999).
7. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004).
8. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990).
9. Pisinger, D., Toth, P.: Knapsack problems. In: Du, D., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, pp. 1-89. Kluwer Academic, Dordrecht (1998).
10. Billionnet, A., Soutif, E.: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 157, 565-575 (2004).
11. Gallo, G., Simeone, B.: On the supermodular knapsack problems. Math. Program. 45, 295-309 (1988).
12. Hammer, P. L., Rader, D. J.: Efficient methods for solving quadratic 0-1 knapsack problems. Inf. Syst. Oper. Res. 35, 170-182 (1997).
13. Michelon, P., Veilleux, L.: Lagrangean methods for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 92, 326-341 (1996).
14. Xie, X. F., Liu, J. M.: A mini-swarm for the quadratic knapsack problem. In: IEEE Swarm Intelligence Symposium (SIS), Honolulu, HI, USA, pp. 190-197 (2007).
15. Caprara, A., Pisinger, D., Toth, P.: Exact solution of the quadratic knapsack problem. INFORMS J. Comput. 11, 125-137 (1999).
16. Billionnet, A., Calmels, F.: Linear programming for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 92, 310-325 (1996).
17. Helmberg, C., Rendl, F., Weismantel, R.: Quadratic knapsack relaxations using cutting planes and semidefinite programming. In: Cunningham, W., McCormick, S., Queyranne, M. (eds.) Proceedings of the Fifth IPCO Conference. Lecture Notes in Computer Science, vol. 1084, pp. 175-189. Springer, Berlin (1996).
18. Rader, D. J., Woeginger, G. J.: The quadratic {0, 1} knapsack problem with series-parallel support. Oper. Res. Lett. 30, 159-166 (2002).
19. Beck, A., Teboulle, M.: Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J. Optim. 11, 179-188 (2000).
20. Jeyakumar, V., Rubinov, A. M., Wu, Z. Y.: Sufficient global optimality conditions for non-convex quadratic optimization problems with box constraints. J. Glob. Optim. 36, 471-481 (2006).
21. Pinar, M. C.: Sufficient global optimality conditions for bivalent quadratic optimization. J. Optim. Theory Appl. 122, 443-440 (2004).
22. Floudas, C. A., Pardalos, P. M., Adjiman, C. S., Esposito, W. R., Gumus, Z. H., Harding, S. T., Klepeis, J. L., Meyer, C. A., Schweiger, C. A.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic, Dordrecht (1999).