A hybrid evolutionary approach to the quadratic knapsack problem

Proceedings of the 3rd Indian International Conference on Artificial Intelligence, IICAI 2007

Volumn , Issue , 2007, Pages 200-208

  Singh, Alok ^a   Baghel, Anurag Singh ^b  

^a UNIVERSITY OF HYDERABAD   (India)

^b BANASTHALI UNIVERSITY   (India)

Author keywords

Combinatorial optimization; Genetic algorithm; Knapsack problem; Quadratic knapsack problem

Indexed keywords

0-1 KNAPSACK PROBLEM; EVOLUTIONARY APPROACH; GENERATIONAL GENETIC ALGORITHMS; GREEDY HEURISTICS; HYBRID APPROACH; INDIVIDUAL OBJECTS; KNAPSACK PROBLEMS; NP-HARD; PROBLEM INSTANCES; QUADRATIC KNAPSACK PROBLEMS; STEADY-STATE GENETIC ALGORITHMS;

ARTIFICIAL INTELLIGENCE; GENETIC ALGORITHMS; PROFITABILITY;

COMBINATORIAL OPTIMIZATION;

EID: 76249090105     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Francisco (1979)
2. Gallo, G., Hammer, P.L., Simeone, B.: Quadratic Knapsack Problems. Mathematical Programming Study 2 (1980), 132-149
3. Billionet, A., Faye, A., Soutif, E.: An Exact Algorithm for the 0-1 Quadratic Knapsack Problem. Proceedings of ISMP'97, Lausanne, Switzerland (1997)
4. Billionet, A., Soutif, E.: An Exact Method based on Lagrangian Decomposition for the 0-1 Quadratic Knapsack Problem. European Journal of Operational Research 157 (2004), 565-575
5. Billionet, A., Soutif, E.: Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem. INFORMS Journal on Computing 16 (2004), 188-197
6. Hammer, P.L., Rader Jr., D.J.: Efficient Methods for Solving Quadratic 0-1 Knapsack Problems. INFOR 35 (1997), 170-182
7. Helmberg, C., Rendl, F., Weismantel, R.: A Semidefinite Programming Approach to the Quadratic Knapsack Problem. Journal of Combinatorial Optimization 4 (2000), 197-215
8. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer-Verlag, Berlin (2003)
9. Caprara, A., Pisinger, D., Toth, P.: Exact Solutions of the Quadratic Knapsack Problem. INFORMS journal on Computing 11(1999), 125-137
10. Pisinger, D., Rasmussen, A.B., Sandvik. R.: Solution of Large-Sized Quadratic Knapsack Problems through Aggressive Reduction, To appear in INFORMS Journal on Computing (2006)
11. Julstrom, B.A.: Greedy, Genetic, and Greedy Genetic Algorithms for the Quadratic Knapsack Problem. Proceedings of GECCO-2005, ACM Press, New York (2005), 607-614
12. Witzgall, C.: Mathematical Methods of Site Selection for Electronic Message System (EMS). NBS Internal Report (1975)
13. Ferreira, C.E., Martin, A., De Souza, C.C., Weismantel, R., Wolsey, L.A.: Formulations and Valid Inequalities for Node Capacitated Graph Partitioning. Mathematical Programming 74 (1996), 247-266
14. Johnson, E.L., Mehrotra, A., Nemhauser, G.L.: Min-Cut Clustering. Mathematical Programming 62 (1993), 133-152
15. Helmberg, C., Rendl, F., Weismantel, R.: Quadratic Knapsack Relaxations using Cutting Planes and Semidefinite Programming. Proceedings of the Fifth IPCO Conference, LNCS 1084, Springer-Verlag, Berlin (1996), 175-189
16. Laughunn, D.L.: Quadratic Binary Programming with Applications to Capital Budgeting Problems. Operations Research 18 (1970), 454-461
17. Rhys, J.: A Selection Problem of Shared Fixed Costs and Network Flows. Management Science 17 (1970), 200-207
18. Park, K., Lee, K., Park, S.: An Extended Formulation Approach to the Edge-Weighted Maximum Clique Problem. European Journal of Operational Research 95 (1996), 671-682