The performance of the modified subgradient algorithm on solving the 0-1 quadratic knapsack problem

Informatica

Volumn 20, Issue 2, 2009, Pages 293-304

  Sipahioglu, Aydin ^a   Sara, Tugba ^a  

^a ESKISEHIR OSMANGAZI UNIVERSITY   (Turkey)

Author keywords

Integer programming; MSG; Quadratic knapsack problem; Sharp augmented lagrangian function

Indexed keywords

EID: 67651225583     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. Bazaraa, M.S., H.D. Sherali and C.M. Shetty (2006). Nonlinear Programming: Theory and Algorithms, 3rd ed. Wiley, New York.
2. Bertsekas, D.P. (1995). Nonlinear Programming, Athena Scientific, Belmont, Massachusetts.
3. Billionnet, A., and F. Calmels (1996). Linear programming for the 0-1 quadratic knapsack problem, European Journal of Operational Research, 92, 310-325.
4. Billionnet, A., and E. Soutif (2003). An exact method based on Lagrangean decomposition for the 0-1 quadratic knapsack problem, European Journal of Operational Research, 157(3), 565-575.
5. Bretthauer, K.M., and B. Shetty (1997). Quadratic resource allocation with generalized upper bounds. Operations Research Letters, 20, 51-57.
6. Burachik, R.S., and C.Y. Kaya (2007). An update rule and a convergence result for a penalty function method. Journal of Industrial Management and Optimization, 3(2), 381-398.
7. Burachik, R.S., R. Gasimov, N. Ismayilova and C.Y. Kaya (2006). On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian, Journal of Global Optimization, 34(1), 55-78.
8. Burachik, R.S., C.Y. Kaya and M. Mammadov (in press). An inexact modified subgradient algorithm for nonconvex optimization, Computational Optimization and Applications. Published online: 29 Jan 2008, DOI: 10.1007/s10589-008- 9168-7.
9. Caprara, A., D. Pisinger and P. Toth (1999). Exact solution of the quadratic knapsack problem. INFORMS Journal on Computing, 11, 125-137.
10. Chaillou, P., P. Hansen and Y. Mahieu (1986). Best network flow bound for the quadratic knapsack problem. Combinatorial Optimization of Lecture Notes in Mathematics, 1403, 225-235.
11. Gallo, G., P.L. Hammer and B. Simeone (1980). Quadratic knapsack problems. Mathematical Programming Study, 12, 132-149.
12. Gasimov, R. (2002). Augmented Lagrangean duality and nondifferantiable optimization methods in non-convex programming. Journal of Global Optimization, 24, 187-203.
13. Gasimov, R.N., and O. Ustun (2005). Solving the quadratic assignment problems using modified subgradient algorithm. In M.B. Durmusoglu, C. Kahraman (Eds.). Proceedings of 35th International Conference on Computers & Industrial Engineering, Istanbul, Turkey. pp. 757-762.
14. Gasimov, R.N., and A.M. Rubinov (2004). On augmented Lagrangeans for optimization problems with a single constraint. Journal of Global Optimization, 28(2), 153-173.
15. Gasimov, R.N., and O. Ustun (2007). Solving the quadratic assignment problem using F-MSG algorithm, Journal of Industrial and Management Optimization, 3(2), 173-191.
16. Helmberg, C., F. Rendl and R. Weismantel (2000). A semidefinite programming approach to the quadratic knapsack problem. Journal of Combinatorial Optimization, 4, 197-215.
17. Hunting, M., U. Faigle, W. Kern (2001). A Lagrangean relaxation approach to the edge-weighted clique problem, European Journal of Operational Research, 131, 119-131.
18. Julstrom, B.A. (2005). Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. In Proceedings of the Genetic and Evolutionary Computation Conference, Vol. 1. pp. 607-614.
19. Kellerer, H., U. Pferschy and D. Pisinger (2004). Knapsack Problems. Springer-Verlag, NY.
20. Li, D. (1999). Zero duality gap in integer programming: P-norm surrogate constraint method. Operations Research Letters, 25, 89-96.
21. Li, H.L. (1992). An approximate method for local optima for nonlinear mixed integer programming problems. Computers and Operations Research, 19(5), 435-444.
22. Martin, W. (1998). Fast equi-partitioning of rectangular domains using stripe decomposition. Discrete Applied Mathematics, 82, 193-207.
23. Michelon, P., and N. Maculan (1993). Lagrangean methods for 0-1 quadratic problems. Discrete Applied Mathematics, 42, 257-269.
24. Michelon, P., and L. Veuilleux (1996). Lagrangean methods for the 0-1 quadratic knapsack problem. European Journal of Operational Research, 92, 326-341.