Vertex adjacencies in the set covering polyhedron
We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvátal for the stable set polytope. We find a sufficient condition for adjacency, and characterize it with similar conditions in the case where the underlyin...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2017 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/53156 |
| Acceso en línea: | http://hdl.handle.net/11336/53156 |
| Access Level: | acceso abierto |
| Palabra clave: | Polyhedral Combinatorics Set Covering Polyhedron Vertex Adjacency https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Sumario: | We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvátal for the stable set polytope. We find a sufficient condition for adjacency, and characterize it with similar conditions in the case where the underlying matrix is row circular. We apply our findings to show a new infinite family of minimally nonideal matrices. |
|---|