A Study of Breakout Local Search for the Minimum Sum Coloring Problem
- 1 January 2012
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- An effective heuristic algorithm for sum coloring of graphsComputers & Operations Research, 2012
- A tabu search approach for the sum coloring problemElectronic Notes in Discrete Mathematics, 2010
- On Sum Coloring of Graphs with Parallel Genetic AlgorithmsLecture Notes in Computer Science, 2007
- Sum coloring of graphsContemporary Mathematics, 2004
- Tabu SearchPublished by Springer Science and Business Media LLC ,1997
- Reactive search, a history-sensitive heuristic for MAX-SATACM Journal of Experimental Algorithmics, 1997
- A study of diversification strategies for the quadratic assignment problemComputers & Operations Research, 1994
- Optimization by Simulated AnnealingScience, 1983