A branch-and-cut algorithm for partition coloring

Networks

Volumn 55, Issue 3, 2010, Pages 194-204

  Frota, Yuri ^a   Maculan, Nelson ^a   Noronha, Thiago F ^b   Ribeiro, Celso C ^c  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^c FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Branch and cut; Formulation by representatives; Partition Coloring

Indexed keywords

ALL-OPTICAL WDM NETWORKS; BRANCH AND CUT; BRANCH-AND-CUT ALGORITHMS; CHROMATIC NUMBER; COLORING PROBLEMS; COMPUTATIONAL EXPERIMENT; GRAPH COLORING PROBLEM; RANDOM GRAPHS; ROUTING AND WAVELENGTH ASSIGNMENT; TABU SEARCH HEURISTIC; UNDIRECTED GRAPH; VALID INEQUALITY;

COLORING; GRAPH THEORY; HEURISTIC ALGORITHMS; LINEAR PROGRAMMING; TABU SEARCH; WAVELENGTH DIVISION MULTIPLEXING;

PARTITIONS (BUILDING);

EID: 77951223847     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20365     Document Type: Conference Paper

References (26)

1. E. Balas andM.W. Padberg, Set partitioning:Asurvey, SIAM Rev 18 (1976), 710-760.
2. D. Brélaz, New methods to color the vertices of a graph, Commun ACM 22 (1979), 251-256.
3. R.J. Brown, Chromatic scheduling and the chromatic number problem, Manage Sci 19 (1972), 451-463.
4. M. Campêlo, V. Campos, and R. Corrêa, On the asymmetric representatives formulation for the vertex coloring problem, Electronic Notes Discrete Math 19 (2005), 337-343.
5. M. Campêlo, R.C. Corrêa, and Y.A.M. Frota, Cliques, holes and the vertex coloring polytope, Inf Process Lett 89 (2004), 159-164.
6. A. Caprara and M. Fischetti, "Branch-and-cut algorithms: An annotated bibliography," Annotated bibliographies in combinatorial optimization, M. Dell'Amico, F. Maffioli, and S. Martello (Editors), Wiley, New York, 1997, pp. 45-63.
7. A. Caprara and J.J.S. Gonzáles, Separating lifted odd-hole inequalities to solve the index selection problem, Discrete Appl Math 92 (1999), 111-134.
8. J.S. Choi, N. Golmie, F. Lapeyrere, F. Mouveaux, and D. Su, "Afunctional classification of routing andwavelength assignment schemes in DWDMnetworks: Static case", Proc 7th Int Conf Opt Commun Networks, Paris (2000), 1109-1115.
9. T.A. Feo and M.G.C. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Oper Res Lett 8 (1989), 67-71.
10. T.A. Feo, M.G.C. Resende, and S.H. Smith, A greedy randomized adaptive search procedure for maximum independent set, Oper Res 42 (1994), 860-878.
11. R. Figueiredo, V. Barbosa, N. Maculan, and C. Souza, Acyclic orientations with path constraints, RAIRO Oper Res 42 (2008), 455-467.
12. F. Glover and M. Laguna, Tabu search, Kluwer, Norwell, MA, 1997.
13. K.L. Hoffman and M. Padberg, Solving airline crew scheduling problems, Manage Sci 39 (1993), 657-682.
14. B. Jaumard, Network and traffic data sets for optical network optimization, Available at: http://users.encs. concordia.ca/?bjaumard, Accessed on January 3, 2008.
15. B. Jaumard, C. Meyer, and X. Yu, Of how much wavelength conversion allows to reduce the blocking rate? Available at: http://users.encs.concordia.ca/? bjaumard/ Publications/2005/Multi-Hop-RWA-2005.pdf, Accessed on September 24, 2008.
16. S.M. Korman, "The graph-coloring problem," Combinatorial optimization, N. Christophides, P. Toth, and C. Sandi (Editors), Wiley, New York, 1979, pp. 211-235.
17. M. Kubale and B. Jackowski, A generalized implicit enumeration algorithm for graph coloring, Commun ACM 28 (1985), 412-418.
18. G. Li and R. Simha, The partition coloring problem and its application to wavelength routing and assignment, Proc 1st Workshop Opt Networks, (CDROM), Dallas (2000).
19. D. Matula, G. Marble, and J. Isaacson, "Graph coloring algorithms," Graph theory and computing, R.C. Read (Editor), Academic Press, New York, 1972, pp. 109-122.
20. A. Mehrotra and M.A. Trick, A column generation approach for graph coloring, Oper Res 42 (1996), 344-354.
21. I. Méndez-Dáaz and P. Zabala, A branch-and-cut algorithm for graph coloring, Discrete Appl Math 154 (2006), 826-847.
22. T.F. Noronha and C.C. Ribeiro, Routing and wavelength assignment by partition coloring, Eur J Oper Res 171 (2006), 797-810.
23. M.G.C. Resende and C.C. Ribeiro, A GRASP with pathrelinking for private virtual circuit routing, Networks 41 (2003), 104-114.
24. M.G.C. Resende and C.C. Ribeiro, "Greedy randomized adaptive search procedures," Handbook of metaheuristics, F. Glover and G. Kochenberger (Editors), Kluwer, Norwell, MA, 2003, pp. 219-249.
25. M.G.C. Resende and C.C. Ribeiro, "GRASP with pathrelinking: Recent advances and applications," Metaheuristics: Progress as real problem solvers, T. Ibaraki, K. Nonobe, and M. Yagiura (Editors), Springer, New York, 2005, pp. 29-63.
26. D. Welsh and M. Powell, An upper bound to the chromatic number of a graph and its application to time-table problems, Comput J 10 (1967), 85-86.