A cutting plane algorithm for graph coloring

Mostrar todas las versiones(3)

We present an approach based on integer programming formulations of the graph coloring problem. Our goal is to develop models that remove some symmetrical solutions obtained by color permutations. We study the problem from a polyhedral point of view and determine some families of facets of the 0/1-p...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Méndez-Díaz, I., Zabala, P.
Formato: JOUR
Materias:
Cutting plane algorithms
Facets of polyhedra
Graph coloring
Integer programming
Computer programming
Graph theory
Problem solving
Algorithms
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0166218X_v156_n2_p159_MendezDiaz
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares