A Hierarchical Social Metaheuristic for the Max-Cut Problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3004, Issue , 2004, Pages 84-94

  Duarte, Abraham ^a   Fernández, Felipe ^b   Sánchez, Ángel ^a   Sanz, Antonio ^a  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS;

APPLICATION AREA; COMPUTATIONAL RESULTS; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; MAX-CUT PROBLEM; META HEURISTICS; NON-PLANAR GRAPHS; STANDARD TESTS; WEIGHTED UNDIRECTED GRAPH;

PROBLEM SOLVING;

EID: 24644481537     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24652-7_9     Document Type: Article

References (18)

1. Burer, S., Monteiro, R.D.C., Zhang X.: Rank-two Relaxation heuristic for the Max-Cut and other Binary Quadratic Programs. SIAM Journal of Optimization, 12:503-521, 2001.
2. Dolezal O., Hofmeister, T., Lefmann, H: A comparison of approximation algorithms for the MAXCUT-problem. Reihe CI 57/99, SFB 531, Universität Dortmund, 1999.
3. Fernández F., Duarte A., Sánchez A.: A Software Pipelining Method Based on Hierarchical Social Algorithms, Proceedings of MISTA Conference, Vol. 1, pp 382-385, Nottingham, UK, 2003.
4. Fernández F., Duarte A., Sdnchez A.: Hierarchical Social Algorithms: A New Metaheuristic for Solving Discrete Bilevcl Optimization Problems, Technical Report ESCET/URF -DTP/ UPM. HSA1 Universidad Politécnica de Madrid, 2003.
5. Festa P., P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro: Randomized heuristics for the MAX-CUT problem, Optimization Methods and Software, vol. 7, pp. 1033-1058, 2002.
6. Goemans, M. X., Williams, D.P.: Improved Approximation Algorithms for Max-Cut and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM.42:11151142,1995.
7. Goldberg. D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.
8. Helmberg, C, Rendl, F.: A Spectral Bundle Method for Semidefinite Programming. SIAM Journal of Computing, 10:673:696, 2000.
9. Karp, R.M.: Reducibility among Combinatorial Problems. In R. Miller J. Thatcher, editors, Complexity of Computers Computation, Prenum Press, New York, USA (1972).
10. Hadlock F. O: Finding a Maximum Cut of a Planar Graph in Polynomial Time. SIAM Journal on Computing 4 (1975) 221-225.
11. Lovàsz, L.: On the Shannon Capacity of a Graph, IEEE Trans, of Information Theory, IT25:1-7, 1978.
12. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. 3rd edn. Springer-Verlag, Berlin Heidelberg New York, 1996.
13. Michalewicz, Z., Fogel. D. B.: How to Solve it: Modern Heuristics, Springer-Verlag, Berlin, 2000.
14. Moscato P., Cotta C.: A Gentle Introduction to Mcmetic Algorithms. In Handbook of Metaheuristic. F. Glover and G. A. Kochenberger, editors, Kluwer, Norwell, Massachusetts, USA, 2003.
15. Resende M.G., Ribeiro C.: Greedy Adaptive Search Procedures. In Handbook of Metaheuristic. F. Glover and G. A. Kochenberger, editors, Kluwer, Massachusetts, USA , 2003.
16. Resende M.G.: GRASP With Path Re-linking and VNS for MAXCUT, In Proceedings of 4th MIC, Porto, July 2001.
17. Spears, W. M.: Evolutionary Algorithms. The Role of Mutation and Recombination, Springer-Verlag, Berlin Heidelberg New York, 1998.
18. Shor, N. Z.: Quadratic Optimization Problems, Soviet Journal of Computing and System Science, 25:1-11,1987.