INVESTIGADORES
ZABALA Paula Lorena
congresos y reuniones científicas
Título:
Facets of the coloring polytope
Autor/es:
PABLO COLL; JAVIER MARENCO; ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA
Lugar:
Atlanta, EE. UU.
Reunión:
Simposio; 17th. ISMP International Symposium of Mathematical Programming; 2000
Institución organizadora:
Mathematical Programming Society
Resumen:
Given a graph G, a coloring of G is an assignment of color to each vertex such that the en dpoints of any edge have different colors. The coloring problem is to find a colorin g of G with the fewest different colors among all possible colorings. We present an integer programming model for this problem. We study the problem from a polyhedral point of view and determine some families of facets of the associated polytope.
