Um algoritmo de planos-de-corte para o número cromático fracionário de um grafo

Pesquisa Operacional

Volumn 29, Issue 1, 2009, Pages 179-193

  Campêlo, Manoel ^a   Campos, Victor A ^a   Corrêa, Ricardo C ^a  

^a FEDERAL UNIVERSITY OF CEARÁ   (Brazil)

Author keywords

Chromatic number; Combinatorial optimization; Cutting planes

Indexed keywords

EID: 67650559117     PISSN: 01017438     EISSN: 16785142     Source Type: Journal    
DOI: 10.1590/s0101-74382009000100009     Document Type: Article

References (25)

1. Atamturk, A.; Nemhauser, G.L. & Savelsbergh, M.W.P. (2000). Conflict graphs in solving integer programming problems. European Journal of Operational Research, 121, 40-55.
2. Brélaz, D. (1979). New methods to color the vertices of a graph. Communications of the ACM, 22(4), 251-256.
3. Brown, J. (1972). Chromatic scheduling and the chromatic number problem. Management Science, 19(4), 456-463.
4. Busygin, S. (2002). Quick almost exact maximum weight clique solver based on a generalized Motzkin-Straus formulation. .
5. Campêlo, M.; Campos, V. & Corrêa, R. (2008). On the asymmetric representatives formulation for the vertex coloring problem. Discrete Applied Mathematics, 156(7), 1097-1111.
6. Campêlo, M.; Corrêa, R. & Frota, Y. (2004). Cliques, holes and the vertex coloring polytope. Information Processing Letters, 89, 159-164.
7. Chow, F. & Hennessy, J. (1990). The priority-based coloring approach to register allocation. ACM Transactions on Programming Languages and Systems, 12(4), 501-536.
8. Dantzig, G.B.; Fulkerson, D.R. & Johnson, S.M. (1954). Solutions of a large-scale travelling salesman problem. Operations Research, 2, 393-410.
9. de Werra, D. (1985). An introduction to timetabling. European Journal of Operations Research, 19, 151-162.
10. Ferreira, C.E. & Wakabayashi, Y. (1996). Combinatória Poliédrica e Planos-de-corte Faciais. X Escola de Computação, Ed. Campinas, SP.
11. Gamst, A. (1986). Some lower bounds for a class of frequency assignment problems. IEEE Transactions on Vehicular Technology, 35(1), 8-14.
12. Glover, F.; Parker, M. & Ryan, J. (1996). Coloring by tabu branch-and-bound. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science [edited by D.S. Johnson and M.A. Trick], vol. 26, 285-307.
13. Hoffman, K. & Padberg, M. (1993). Solving airline crew scheduling by branch and cut. Management Science, 39(6), 657-682.
14. Johnson, D. & Trick, M. (1996). Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society.
15. Kubale, M. & Jackowski, B. (1985). A generalized implicit enumeration algorithm for graph coloring. Communications of the ACM, 28(4), 412-418.
16. Larsen, M.; Propp, J. & Ullman, D. (1995). The fractional chromatic number of Mycielski's graphs. Journal of Graph Theory, 19(3), 411-416.
17. Lund, C. & Yannakakis, M. (1994). On the hardness of approximating minimization problems. Journal of the ACM, 41(5), 960-981.
18. Mehrotra, A. & Trick, M. (1996). A column generation approach for graph coloring. INFORMS Journal in Computing, 8(4), 344-354.
19. Nemhauser, G. & Sigismondi, G. (1992). A strong cutting plane/branch-and-bound algorithm for node packing. Journal of Operational Research Society, 43(5), 443-457.
20. Nemhauser, G. & Wolsey, L. (1988). Integer and Combinatorial Optimization. Wiley.
21. Peemöller, J. (1983). A correction to Brélaz's modification of Brown's coloring algorithm. Communications of the ACM, 26(8), 595-597.
22. Rossi, F. & Smriglio, S. (2001). A branch-and-cut algorithm for the maximum cardinality stable set problem. Operations Research Letters, 28, 63-74.
23. Saad, Y. (1996). Iterative Methods for Sparse Linear Systems. PWS Publishing Company, Boston, MA, USA.
24. Sewell, E. (1996). An improved algorithm for exact graph coloring. ORSA Journal on Computing, 3, 226-373.
25. Trick, M. (1996). Appendix: Second DIMACS Challenge test problems. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science [edited by D.S. Johnson and M.A. Trick], vol.26, 653-657. Disponível em .