Vertex adjacencies in the set covering polyhedron

dc.creatorAguilera, Néstor Edgardo
dc.creatorKatz, Ricardo David
dc.creatorTolomei, Paola Beatriz
dc.date.accessioned2018-07-26T15:09:44Z
dc.date.accessioned2018-11-06T11:47:07Z
dc.date.available2018-07-26T15:09:44Z
dc.date.available2018-11-06T11:47:07Z
dc.date.created2018-07-26T15:09:44Z
dc.date.issued2017-02
dc.identifierAguilera, Néstor Edgardo; Katz, Ricardo David; Tolomei, Paola Beatriz; Vertex adjacencies in the set covering polyhedron; Elsevier Science; Discrete Applied Mathematics; 218; 2-2017; 40-56
dc.identifier0166-218X
dc.identifierhttp://hdl.handle.net/11336/53156
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1859527
dc.description.abstractWe 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.
dc.languageeng
dc.publisherElsevier Science
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/https://dx.doi.org/10.1016/j.dam.2016.10.024
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0166218X16305066
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectPOLYHEDRAL COMBINATORICS
dc.subjectSET COVERING POLYHEDRON
dc.subjectVERTEX ADJACENCY
dc.titleVertex adjacencies in the set covering polyhedron
dc.typeArtículos de revistas
dc.typeArtículos de revistas
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución