Lift-and-project ranks of the stable set polytope of joined a-perfect graphs | ||
| dc.conicet.fuente | individual | |
| dc.conicet.organizacion | Universidad Nacional de Rosario | |
| dc.conicet.organizacion | Universidad Nacional de Rosario | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas | |
| dc.conicet.organizacion | Universidad Nacional de Rosario | |
| dc.conicet.paisOrganizacion | Argentina | |
| dc.conicet.paisOrganizacion | Argentina | |
| dc.conicet.paisOrganizacion | Argentina | |
| dc.conicet.paisOrganizacion | Argentina | |
| dc.conicet.produccionid | 7410345 | |
| dc.contributor.author | Bianchi, S | |
| dc.contributor.author | Escalante, Mariana Silvina | |
| dc.contributor.author | Montelar, María Susana | |
| dc.date.accessioned | 2018-07-23T17:24:13Z | |
| dc.date.available | 2018-07-23T17:24:13Z | |
| dc.date.issued | 2016-09 | |
| dc.date.updated | 2018-07-23T12:58:57Z | |
| dc.description.abstract | In this paper we study lift-and-project polyhedral operators defined by Lovász and Schrijver and Balas, Ceria and Cornuéjols on the clique relaxation of the stable set polytope of webs. We compute the disjunctive rank of all webs and consequently of antiwebs. We also obtain the disjunctive rank of the antiweb constraints for which the complexity of the separation problem is still unknown. Finally, we use our results to provide bounds of the disjunctive rank of larger classes of graphs as joined a-perfect graphs, where near-bipartite graphs belong to. | es |
| dc.description.fil | Fil: Bianchi, S. Universidad Nacional de Rosario; Argentina | |
| dc.description.fil | Fil: Escalante, Mariana Silvina. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina | |
| dc.description.fil | Fil: Montelar, María Susana. Universidad Nacional de Rosario; Argentina | |
| dc.format | application/pdf | es |
| dc.identifier.citation | Bianchi, S; Escalante, Mariana Silvina; Montelar, María Susana; Lift-and-project ranks of the stable set polytope of joined a-perfect graphs; Elsevier Science; Discrete Applied Mathematics; 210; 9-2016; 176-184 | es |
| dc.identifier.institucional | CONICET | |
| dc.identifier.issn | 0166-218X | es |
| dc.identifier.repo | CONICET Digital | |
| dc.identifier.uri | http://hdl.handle.net/11336/52835 | |
| dc.journal.ciudad | Amsterdam | es |
| dc.journal.pagination | 176-184 | es |
| dc.journal.pais | Países Bajos | es |
| dc.journal.title | Discrete Applied Mathematics | es |
| dc.journal.volume | 210 | es |
| dc.language.iso | eng | es |
| dc.publisher | Elsevier Science | es |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/doi/https://dx.doi.org/10.1016/j.dam.2015.11.001 | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0166218X15005272 | |
| dc.rights | info:eu-repo/semantics/openAccess | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | * |
| dc.subject | Lift-And-Project Operators | es |
| dc.subject | Polyhedral Combinatorics | es |
| dc.subject | Stable Set Polytope | es |
| dc.subject | Webs | es |
| dc.subject.classification | Matemática Aplicada | es |
| dc.subject.classification | Matemáticas | es |
| dc.subject.classification | CIENCIAS NATURALES Y EXACTAS | es |
| dc.subject.classification | Ciencias de la Computación | es |
| dc.subject.classification | Ciencias de la Computación e Información | es |
| dc.subject.classification | CIENCIAS NATURALES Y EXACTAS | es |
| dc.title | Lift-and-project ranks of the stable set polytope of joined a-perfect graphs | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
Archivos
Bloque original
Cargando...
- Nombre:
- CONICET_Digital_Nro.b25fcde4-6ee3-481f-a8c2-d555f7009018_A.pdf
- Tamaño:
- 436.24 KB
- Formato:
- Adobe Portable Document Format