On the Chvátal-rank of facets for the set covering polyhedron of circular matrices

Abstract

We study minor related row family inequalities for the set covering polyhedron of circular matrices. We address the issue of generating these inequalities via the Chvátal-Gomory procedure and establish a general upper bound for their Chvátal-rank. Moreover, we provide a construction to obtain facets with arbitrarily large coefficients and examples of facets having Chvátal-rank strictly larger than one.Fil: Nasini, Graciela Leonor. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Torres, Luis Miguel. Limos; FranciaFil: Kerivin, Hervé. Limos; FranciaFil: Wagler, Annegrete. Limos; FranciaJoint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization (EURO/ALIO 2018)BolognaItaliaAssociation of European Operational Research SocietiesAssociation of Latin-Iberoamerican Operational Research Societie