Lift and project relaxations for the matching and related polytopes

Autores
Aguilera, Néstor Edgardo; Bianchi, Silvia María; Nasini, Graciela Leonor
Año de publicación
2004
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We compare lift and project methods given by Lovász and Schrijver (the N+ and N procedures) and by Balas, Ceria and Cornuéjols (the disjunctive procedure) when working on the matching, perfect matching and covering polytopes. When the underlying graph is the complete graph of n=2s+1 nodes we obtain that the disjunctive index for all problems is s2, the N+-index for the matching and perfect matching problems is s (extending a result by Stephen and Tunçel), the N-index for the perfect matching problem is s, and the N+ and N indices for the covering problem and the N-index for the matching problem are strictly greater than s.
Fil: Aguilera, Néstor Edgardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Fil: Bianchi, Silvia María. Universidad Nacional de Rosario; Argentina
Fil: Nasini, Graciela Leonor. Universidad Nacional de Rosario; Argentina
Materia
COVERING
MATCHING
POLYHEDRAL COMBINATORICS
SEQUENTIAL TIGHTENING PROCEDURES
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/100619
Acceder
id CONICETDig_8457db9912f93571a4bebc66d90c6f77
oai_identifier_str oai:ri.conicet.gov.ar:11336/100619
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Lift and project relaxations for the matching and related polytopesAguilera, Néstor EdgardoBianchi, Silvia MaríaNasini, Graciela LeonorCOVERINGMATCHINGPOLYHEDRAL COMBINATORICSSEQUENTIAL TIGHTENING PROCEDUREShttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1We compare lift and project methods given by Lovász and Schrijver (the N+ and N procedures) and by Balas, Ceria and Cornuéjols (the disjunctive procedure) when working on the matching, perfect matching and covering polytopes. When the underlying graph is the complete graph of n=2s+1 nodes we obtain that the disjunctive index for all problems is s2, the N+-index for the matching and perfect matching problems is s (extending a result by Stephen and Tunçel), the N-index for the perfect matching problem is s, and the N+ and N indices for the covering problem and the N-index for the matching problem are strictly greater than s.Fil: Aguilera, Néstor Edgardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; ArgentinaFil: Bianchi, Silvia María. Universidad Nacional de Rosario; ArgentinaFil: Nasini, Graciela Leonor. Universidad Nacional de Rosario; ArgentinaElsevier Science2004-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/100619Aguilera, Néstor Edgardo; Bianchi, Silvia María; Nasini, Graciela Leonor; Lift and project relaxations for the matching and related polytopes; Elsevier Science; Discrete Applied Mathematics; 134; 1-2004; 193-2120166-218XCONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/S0166-218X(03)00337-8info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-10T13:05:10Zoai:ri.conicet.gov.ar:11336/100619instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-10 13:05:10.479CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Lift and project relaxations for the matching and related polytopes
title Lift and project relaxations for the matching and related polytopes
spellingShingle Lift and project relaxations for the matching and related polytopes
Aguilera, Néstor Edgardo
COVERING
MATCHING
POLYHEDRAL COMBINATORICS
SEQUENTIAL TIGHTENING PROCEDURES
title_short Lift and project relaxations for the matching and related polytopes
title_full Lift and project relaxations for the matching and related polytopes
title_fullStr Lift and project relaxations for the matching and related polytopes
title_full_unstemmed Lift and project relaxations for the matching and related polytopes
title_sort Lift and project relaxations for the matching and related polytopes
dc.creator.none.fl_str_mv Aguilera, Néstor Edgardo
Bianchi, Silvia María
Nasini, Graciela Leonor
author Aguilera, Néstor Edgardo
author_facet Aguilera, Néstor Edgardo
Bianchi, Silvia María
Nasini, Graciela Leonor
author_role author
author2 Bianchi, Silvia María
Nasini, Graciela Leonor
author2_role author
author
dc.subject.none.fl_str_mv COVERING
MATCHING
POLYHEDRAL COMBINATORICS
SEQUENTIAL TIGHTENING PROCEDURES
topic COVERING
MATCHING
POLYHEDRAL COMBINATORICS
SEQUENTIAL TIGHTENING PROCEDURES
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv We compare lift and project methods given by Lovász and Schrijver (the N+ and N procedures) and by Balas, Ceria and Cornuéjols (the disjunctive procedure) when working on the matching, perfect matching and covering polytopes. When the underlying graph is the complete graph of n=2s+1 nodes we obtain that the disjunctive index for all problems is s2, the N+-index for the matching and perfect matching problems is s (extending a result by Stephen and Tunçel), the N-index for the perfect matching problem is s, and the N+ and N indices for the covering problem and the N-index for the matching problem are strictly greater than s.
Fil: Aguilera, Néstor Edgardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Fil: Bianchi, Silvia María. Universidad Nacional de Rosario; Argentina
Fil: Nasini, Graciela Leonor. Universidad Nacional de Rosario; Argentina
description We compare lift and project methods given by Lovász and Schrijver (the N+ and N procedures) and by Balas, Ceria and Cornuéjols (the disjunctive procedure) when working on the matching, perfect matching and covering polytopes. When the underlying graph is the complete graph of n=2s+1 nodes we obtain that the disjunctive index for all problems is s2, the N+-index for the matching and perfect matching problems is s (extending a result by Stephen and Tunçel), the N-index for the perfect matching problem is s, and the N+ and N indices for the covering problem and the N-index for the matching problem are strictly greater than s.
publishDate 2004
dc.date.none.fl_str_mv 2004-01
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/100619
Aguilera, Néstor Edgardo; Bianchi, Silvia María; Nasini, Graciela Leonor; Lift and project relaxations for the matching and related polytopes; Elsevier Science; Discrete Applied Mathematics; 134; 1-2004; 193-212
0166-218X
CONICET Digital
CONICET
url http://hdl.handle.net/11336/100619
identifier_str_mv Aguilera, Néstor Edgardo; Bianchi, Silvia María; Nasini, Graciela Leonor; Lift and project relaxations for the matching and related polytopes; Elsevier Science; Discrete Applied Mathematics; 134; 1-2004; 193-212
0166-218X
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/S0166-218X(03)00337-8
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842980183027482624
score 12.993085

Publicaciones similares