A Branch-and-cut Algorithm For Equitable Coloring Based On A Formulation By Representatives

dc.creatorBahiense L.
dc.creatorFrota Y.
dc.creatorMaculan N.
dc.creatorNoronha T.F.
dc.creatorRibeiro C.C.
dc.date2009
dc.date2015-06-26T13:32:30Z
dc.date2015-11-26T15:29:15Z
dc.date2015-06-26T13:32:30Z
dc.date2015-11-26T15:29:15Z
dc.date.accessioned2018-03-28T22:37:58Z
dc.date.available2018-03-28T22:37:58Z
dc.identifier
dc.identifierElectronic Notes In Discrete Mathematics. , v. 35, n. C, p. 347 - 352, 2009.
dc.identifier15710653
dc.identifier10.1016/j.endm.2009.11.057
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70949097146&partnerID=40&md5=0736f436f13104ee8126a3bc3d1f7629
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/91568
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/91568
dc.identifier2-s2.0-70949097146
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1261789
dc.description[No abstract available]
dc.description35
dc.descriptionC
dc.description347
dc.description352
dc.descriptionBahiense, 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
dc.descriptionCampê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
dc.descriptionCampêlo, M., Corrêa, R.C., Frota, Y., Cliques, holes and the vertex coloring polytope (2004) Information Processing Letters, 89, pp. 159-164
dc.descriptionFrota, Y., Maculan, N., Noronha, T.F., Ribeiro, C.C., A branch-and-cut algorithm for partition coloring (2009) Networks, , to appear
dc.descriptionFurmańczyk, H., Kubale, M., The Complexity of Equitable Vertex Coloring of Graphs (2005) Journal of Applied Computer Science, 13, pp. 95-107
dc.descriptionMé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
dc.descriptionMeyer, W., Equitable coloring (1973) American Mathematical Monthly, 80, pp. 143-149
dc.descriptionTouhami, S., (2004) Optimization problems in cellular Networks, , PhD thesis, John Molson School of Business, Concordia University, Montreal
dc.descriptionTucker, A., Perfect graphs and an application to optimizing municipal services (1973) SIAM Review, 15, pp. 585-590
dc.languageen
dc.publisher
dc.relationElectronic Notes in Discrete Mathematics
dc.rightsfechado
dc.sourceScopus
dc.titleA Branch-and-cut Algorithm For Equitable Coloring Based On A Formulation By Representatives
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución