Solving a multicoloring problem with overlaps using integer programming

Mostrar todas las versiones(3)

This paper presents a new generalization of the graph multicoloring problem. We propose a Branch-and-Cut algorithm based on a new integer programming formulation. The cuts used are valid inequalities that we could identify to the polytope associated with the model. The Branch-and-Cut system includes...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Méndez-Díaz, I., Zabala, P.
Formato: Artículo publishedVersion
Lenguaje:Inglés
Publicado: 2010
Materias:
Branch-and-Cut
Graph multicoloring
Integer programming
Branch-and-cut
Branch-and-cut algorithms
Integer programming formulations
Multicoloring
Polytopes
Random instance
Valid inequality
Dynamic programming
Heuristic methods
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0166218X_v158_n4_p349_MendezDiaz
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares