Polyhedra associated with identifying codes

Autores
Argiroffo, G.; Bianchi, S.; Wagler, A.
Año de publicación
2013
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
In this work we study the associated polyhedra and present some general results on their combinatorial structure. We demonstrate how the polyhedral approach can be applied to find minimum identifying codes for special bipartite graphs and cycles, and discuss further lines of research in order to obtain strong lower bounds stemming from linear relaxations of the identifying code polyhedron, enhanced by suitable cutting planes to be used in a B&C framework.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Associated polyhedra
B&C framework
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/94542
Acceder
id SEDICI_3494d0f90ebb75fdae53530b5ad56930
oai_identifier_str oai:sedici.unlp.edu.ar:10915/94542
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Polyhedra associated with identifying codesArgiroffo, G.Bianchi, S.Wagler, A.Ciencias InformáticasAssociated polyhedraB&C frameworkIn this work we study the associated polyhedra and present some general results on their combinatorial structure. We demonstrate how the polyhedral approach can be applied to find minimum identifying codes for special bipartite graphs and cycles, and discuss further lines of research in order to obtain strong lower bounds stemming from linear relaxations of the identifying code polyhedron, enhanced by suitable cutting planes to be used in a B&C framework.Sociedad Argentina de Informática e Investigación Operativa2013-09info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf2http://sedici.unlp.edu.ar/handle/10915/94542enginfo:eu-repo/semantics/altIdentifier/issn/1850-2865info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-11-05T12:59:03Zoai:sedici.unlp.edu.ar:10915/94542Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-11-05 12:59:03.535SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Polyhedra associated with identifying codes
title Polyhedra associated with identifying codes
spellingShingle Polyhedra associated with identifying codes
Argiroffo, G.
Ciencias Informáticas
Associated polyhedra
B&C framework
title_short Polyhedra associated with identifying codes
title_full Polyhedra associated with identifying codes
title_fullStr Polyhedra associated with identifying codes
title_full_unstemmed Polyhedra associated with identifying codes
title_sort Polyhedra associated with identifying codes
dc.creator.none.fl_str_mv Argiroffo, G.
Bianchi, S.
Wagler, A.
author Argiroffo, G.
author_facet Argiroffo, G.
Bianchi, S.
Wagler, A.
author_role author
author2 Bianchi, S.
Wagler, A.
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Associated polyhedra
B&C framework
topic Ciencias Informáticas
Associated polyhedra
B&C framework
dc.description.none.fl_txt_mv In this work we study the associated polyhedra and present some general results on their combinatorial structure. We demonstrate how the polyhedral approach can be applied to find minimum identifying codes for special bipartite graphs and cycles, and discuss further lines of research in order to obtain strong lower bounds stemming from linear relaxations of the identifying code polyhedron, enhanced by suitable cutting planes to be used in a B&C framework.
Sociedad Argentina de Informática e Investigación Operativa
description In this work we study the associated polyhedra and present some general results on their combinatorial structure. We demonstrate how the polyhedral approach can be applied to find minimum identifying codes for special bipartite graphs and cycles, and discuss further lines of research in order to obtain strong lower bounds stemming from linear relaxations of the identifying code polyhedron, enhanced by suitable cutting planes to be used in a B&C framework.
publishDate 2013
dc.date.none.fl_str_mv 2013-09
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/94542
url http://sedici.unlp.edu.ar/handle/10915/94542
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/1850-2865
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
2
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1847978633278259200
score 13.084122

Publicaciones similares