Artículos de revistas
A Branch-and-cut Algorithm For Equitable Coloring Based On A Formulation By Representatives
Registro en:
Electronic Notes In Discrete Mathematics. , v. 35, n. C, p. 347 - 352, 2009.
15710653
10.1016/j.endm.2009.11.057
2-s2.0-70949097146
Autor
Bahiense L.
Frota Y.
Maculan N.
Noronha T.F.
Ribeiro C.C.
Institución
Resumen
[No abstract available] 35 C 347 352 Bahiense, L., Jurkiewicz, S., Lozano, A., Pimenta, M., Waga, C., Valladares, C., An integer programming approach to equitable coloring problems (2007) Proceedings of the XXXIX Brazilian Symposium on Operations Research, 1, pp. 1795-1801. , Fortaleza Campêlo, M., Campos, V., Corrêa, R., On the asymmetric representatives formulation for the vertex coloring problem (2005) Electronic Notes in Discrete Mathematics, 19, pp. 337-343 Campêlo, M., Corrêa, R.C., Frota, Y., Cliques, holes and the vertex coloring polytope (2004) Information Processing Letters, 89, pp. 159-164 Frota, Y., Maculan, N., Noronha, T.F., Ribeiro, C.C., A branch-and-cut algorithm for partition coloring (2009) Networks, , to appear Furmańczyk, H., Kubale, M., The Complexity of Equitable Vertex Coloring of Graphs (2005) Journal of Applied Computer Science, 13, pp. 95-107 Méndez-Díaz, I., Nasini, G., Severin, D., A polyhedral approach for the graph equitable coloring problem (2008) Proceedings of the VI ALIO/EURO Workshop on Applied Combinatorial Optimization, , Buenos Aires Meyer, W., Equitable coloring (1973) American Mathematical Monthly, 80, pp. 143-149 Touhami, S., (2004) Optimization problems in cellular Networks, , PhD thesis, John Molson School of Business, Concordia University, Montreal Tucker, A., Perfect graphs and an application to optimizing municipal services (1973) SIAM Review, 15, pp. 585-590