Méndez-Díaz, I. - Zabala, P.

En:

Discrete Appl Math 2008;156(2):159-179

Fecha:

2008

Formato:

application/pdf

Tipo de documento:

info:eu-repo/semantics/article
info:ar-repo/semantics/artículo
info:eu-repo/semantics/publishedVersion

Descriptores:

Cutting plane algorithms - Facets of polyhedra - Graph coloring - Integer programming - Computer programming - Graph theory - Integer programming - Problem solving - Cutting plane algorithms

Descripción:

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-polytope associated with one of these integer programming formulations. The theoretical results described here are used to design an efficient Cutting Plane algorithm. © 2007 Elsevier B.V. All rights reserved.
Fil:Méndez-Díaz, I. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fil:Zabala, P. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.

Identificador(es):

http://hdl.handle.net/20.500.12110/paper_0166218X_v156_n2_p159_MendezDiaz

Derechos:

info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/2.5/ar

Descargar texto: paper_0166218X_v156_n2_p159_MendezDiaz.oai

(tamaño kb)

Cita bibliográfica:

Méndez-Díaz, I. (2008). A cutting plane algorithm for graph coloring (info:eu-repo/semantics/article). [consultado: ] Disponible en el Repositorio Digital Institucional de la Universidad de Buenos Aires: <http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&cl=CL1&d=paper_0166218X_v156_n2_p159_MendezDiaz_oai>