Graciela Nasini, Luis M. Torres, Hervé Kerivin, Annegret Wagler
{"title":"关于覆盖圆形矩阵多面体集合的面的Chvátal-rank","authors":"Graciela Nasini, Luis M. Torres, Hervé Kerivin, Annegret Wagler","doi":"10.1016/j.endm.2018.07.012","DOIUrl":null,"url":null,"abstract":"<div><p>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.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.012","citationCount":"0","resultStr":"{\"title\":\"On the Chvátal-rank of facets for the set covering polyhedron of circular matrices\",\"authors\":\"Graciela Nasini, Luis M. Torres, Hervé Kerivin, Annegret Wagler\",\"doi\":\"10.1016/j.endm.2018.07.012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>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.</p></div>\",\"PeriodicalId\":35408,\"journal\":{\"name\":\"Electronic Notes in Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.012\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571065318301562\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301562","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
On the Chvátal-rank of facets for the set covering polyhedron of circular matrices
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.
期刊介绍:
Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.