Competitive simulated annealing and Tabu Search algorithms for the max-cut problem

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 1797-1798

  Arráiz, Emely ^a   Olivo, Oswaldo ^a  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

Algorithms; Max cut; Metaheuristic; Simulated annealing; Tabu Search

Indexed keywords

GENERATION METHOD; MAX-CUT; MAX-CUT PROBLEM; METAHEURISTIC; NP-HARD; SCATTER SEARCH; STATE-OF-THE-ART METHODS; STATISTICAL PHYSICS; TABU SEARCH ALGORITHMS; VLSI DESIGN; WEIGHTED GRAPH;

ANNEALING; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; LEARNING ALGORITHMS; TABU SEARCH;

SIMULATED ANNEALING;

EID: 72749095009     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1570167     Document Type: Conference Paper

References (7)

1. Arráiz, E., Olivo, O. Competitive Simulated Annealing and Tabu Search Algorithms for the Max-Cut Problem. www.ldc.usb.ve/~olivo/ publications/CompetitiveSAandTSforMaxCut.pdf
2. Deza, M. and Laurent, M. Applications of Cut Polyhedra I. Journal of Computational Applied Math, 55(2):191{216, November 1994.
3. Gaspero, L.D. and Schaerf, A. Tabu Search Techniques for Examination Timetabling. Lecture Notes in Computer Science, 2079:104{117, 2001.
4. Glover, F. Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems. Discrete Applied Mathematics, 65(1-3):223{253, 1996.
5. Helmberg, C. and Rendl, F. A Spectral Bundle Method for Semidefinite Programming. siopt, 10(3):673{696, 2000.
6. Kahruman, S., Kolotoglu, E., Butenko, S. and Hicks, I.V. On Greedy Construction Heuristics for the MAX-CUT Problem. International Journal of Computational Science and Engineering, 3(3):211{218, 2007.
7. Martí, R., Duarte, A. and Laguna, M. Advanced Scatter Search for the Max-Cut Problem. Informs Journal on Computing, page ijoc.1080.0275, 2008.