Bounding vertex coloring by truncated multistage branch and bound

Networks

Volumn 44, Issue 4, 2004, Pages 231-242

  Caramia, Massimiliano ^a   Dell'Olmo, Paolo ^b  

^a FONDAZIONE POLICLINICO UNIVERSITARIO A GEMELLI IRCCS   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Branch and bound algorithm; Chromatic number; Combinatorial optimization; Heuristic; Lower bound

Indexed keywords

ALGORITHMS; BENCHMARKING; COLORING; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; MONOCHROMATORS; OPTIMIZATION;

BRANCH AND BOUND ALGORITHM; CHROMATIC NUMBER; COMBINATORIAL OPTIMIZATION; LOWER BOUND;

CHROMATE COATINGS;

EID: 9744253091     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20035     Document Type: Article

References (21)

1. D. Brelaz, New methods to color the vertices of a graph, Comm ACM 22 (1979), 251-256.
2. J.R. Brown, Chromatic scheduling and the chromatic number problem, Manage Sci 19 (1972), 456-463.
3. M. Caramia and P. Dell'Olmo, A fast and simple local search for graph coloring, Proc. of the 3rd Workshop on Algorithm Engineering, London, UK, Lecture Notes in Computer Science 1668, Springer-Verlag, Berlin, 1999, pp. 319-333.
4. M. Caramia and P. Dell'Olmo, Iterative coloring extension of a maximum clique, Naval Res Logist 48 (2001), 518-550.
5. M. Caramia and P. Dell'Olmo, Constraint propagation in graph coloring, J Heurist 8 (2002), 83-107.
6. R. Carraghan and P.M. Pardalos, An exact algorithm for the maximum clique problem, Operat Res Lett 9 (1990), 375-382.
7. N. Christofides, Graph theory: An algorithmic approach, Academic Press, London, 1975.
8. R. Dorne and J.K. Hao, "Tabu search for graph coloring, T-colorings and set T-colorings," Meta-heuristics: Advances and trends in local search paradigms for optimization, S. Voß, S. Martello, I.H. Osman, and C. Roucairol (Editors), Kluwer Academic Publishers, Amsterdam, 1999, pp. 77-92.
9. C. Fleurent and J.A. Ferland, Genetic and hybrid algorithms for graph coloring, Ann Operat Res 63 (1995), 437-461.
10. C. Fleurent and J.A. Ferland, "Object-oriented implementation of heuristic search methods for graph coloring," DIMACS series on discrete mathematics and theoretical computer science: Maximum clique and satisfiability, vol. 26, D.S. Johnson and M.A. Trick (Editors), AMS, Providence, 1996, pp. 619-652.
11. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of script N sign℘-completeness, W.H. Freeman & Company, New York, 1979.
12. A. Hertz and D. De Werra, Using tabu search techniques for graph coloring, Computing 39 (1987), 345-351.
13. D.R. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon, Optimization by simulated annealing: An experimental evaluation; part ii, graph coloring and number partitioning, Operat Res 39 (1991), 378-406.
14. M. Kubale and B. Jackowski, A generalized implicit enumeration algorithm for graph coloring, Commun ACM 28 (1985), 412-418.
15. A. Mehrotra and M.A. Trick, A column generation approach for graph coloring, INFORMS J Comput 8 (1996), 344-354.
16. I. Mendez Diaz and P. Zabala, A branch and cut algorithm for graph coloring, Proceedings of the Computational Symposium on Graph Coloring and its Generalization, Ithaca, NY, 2002 (http://mat.gsia.cmu.edu/COLOR02).
17. C. Morgenstern, "Distributed coloration neighborhood search," DIMACS series on discrete mathematics and theoretical computer science: Maximum clique and satisfiability, vol. 26, D.S. Johnson and M.A. Trick (Editors), AMS, Providence, 1996, pp. 335-358.
18. J. Mycielski, Sur le coloriage des graphs, Coll Math 3 (1955), 161-162.
19. T.J. Sager and S. Lin, A pruning procedure for exact graph coloring, ORSA J Comput 3 (1993), 226-230.
20. E.C. Sewell, "An improved algorithm for exact graph coloring," DIMACS series on discrete mathematics and theoretical computer science: Maximum clique and satisfiability, vol. 26, D.S. Johnson and M.A. Trick (Editors), AMS, Providence, 1996, pp. 359-373.
21. A. Van Gelder, Another look at graph coloring via prepositional satisfiability, Proceedings of the Computational Symposium on Graph Coloring and its Generalization, Ithaca, NY, 2002 (http://mat.gsia.cmu.edu/COLOR02).