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.

Año de publicación:

2018

Keywords:

  • circulant matrices
  • set covering polyhedron
  • Chvátal-rank

Fuente:

scopusscopus
googlegoogle

Tipo de documento:

Article

Estado:

Acceso restringido

Áreas de conocimiento:

  • Optimización matemática
  • Optimización matemática
  • Optimización matemática

Áreas temáticas: