INVESTIGADORES
ZABALA Paula Lorena
congresos y reuniones científicas
Título:
Cut-and-branch Algorithm for the Partitioned Graph Coloring Problem
Autor/es:
SANTIAGO PALLADINO; ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA
Lugar:
Buenos Aires
Reunión:
Congreso; 2010 ALIO-INFORMS Joint International Meeting; 2010
Institución organizadora:
ALIO/INFORMS
Resumen:
The partitioned graph coloring problem, used for wavelength routing and assignment in WDM networks, is a generalization of the standard coloring problem in which the set of nodes is partitioned and only one per partition must be colored. In this paper we present an integer programming formulation for it, extending the CP model presented by Méndez-Díaz and Zabala for the coloring problem, along with valid inequalities for its polytope and a Cut and Branch algorithm to test their effectiveness.
