Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560]

Discrete Applied Mathematics

Volumn 157, Issue 7, 2009, Pages 1335-1336

  Hertz, Alain ^a   Plumettaz, Matthieu ^b   Zufferey, Nicolas ^c  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^b EPFL   (Switzerland)

^c UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 62549157342     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.11.008     Document Type: Article

References (9)

1. Mladenović N. Formulation Space Search - a new approach to optimization (plenary talk). In: Vuleta J. (Ed). Proceedings of XXXII SYMOPIS'05 (2005), Vrnjacka Banja, Serbia
2. Mladenović N., Plastria F., and Urošević D. Reformulation descent applied to circle packing problems. Computers & Operations Research 32 (2005) 2419-2434
3. Mladenović N., Plastria F., and Urošević D. Stochastic formulation space search methods. Proceedings of EURO XXI (2006), Reykjavik, Iceland
4. F. Plastria, N. Mladenović, D. Urošević, Variable neighborhood formulation space search for circle packing. in: 18th Mini Euro Conference VNS, Tenerife, Spain, ISBN: 84-686-5679-1, 2005
5. Mladenović N., and Hansen P. Variable neighborhood search. Computers & Operations Research 24 (1997) 1097-1100
6. DIMACS Website ftp://dimacs.rutgers.edu/pub/challenge/graph/
7. Avanthay C., Hertz A., and Zufferey N. A variable neighborhood search for graph coloring. European Journal of Operational Research 151 (2003) 379-388
8. Morgenstern C. Distributed coloration neighborhood search. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26 (1996) 335-357
9. Gendron B., Hertz A., and St-Louis P. On edge orienting methods for graph coloring. Journal of Combinatorial Optimization 13 (2007) 163-178