Modelling and solving the perfect edge domination problem
- Autores
- do Forte, Vinicius L.; Lin, Min Chih; Lucena, Abilio; Maculan, Nelson; Moyano, Verónica Andrea; Szwarcfiter, Jayme L.
- Año de publicación
- 2018
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- A formulation is proposed for the perfect edge domination problem and some exact algorithms based on it are designed and tested. So far, perfect edge domination has been investigated mostly in computational complexity terms. Indeed, we could find no previous explicit mathematical formulation or exact algorithm for the problem. Furthermore, testing our algorithms also represented a challenge. Standard randomly generated graphs tend to contain a single perfect edge dominating solution, i.e., the trivial one, containing all edges in the graph. Accordingly, some quite elaborated procedures had to be devised to have access to more challenging instances. A total of 736 graphs were thus generated, all of them containing feasible solutions other than the trivial ones. Every graph giving rise to a weighted and a non weighted instance, all instances solved to proven optimality by two of the algorithms tested.
Fil: do Forte, Vinicius L.. Universidade Federal Rural do Rio de Janeiro; Brasil
Fil: Lin, Min Chih. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina
Fil: Lucena, Abilio. Universidade Federal do Rio de Janeiro; Brasil
Fil: Maculan, Nelson. Universidade Federal do Rio de Janeiro; Brasil
Fil: Moyano, Verónica Andrea. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina
Fil: Szwarcfiter, Jayme L.. Universidade do Estado de Rio do Janeiro; Brasil. Universidade Federal do Rio de Janeiro; Brasil - Materia
-
COMPUTATIONAL RESULTS
EXACT ALGORITHMS
INSTANCE GENERATION
PERFECT EDGE DOMINATION - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/92974
Ver los metadatos del registro completo
id |
CONICETDig_a38e7434cdea9370120cb73c4810f438 |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/92974 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
Modelling and solving the perfect edge domination problemdo Forte, Vinicius L.Lin, Min ChihLucena, AbilioMaculan, NelsonMoyano, Verónica AndreaSzwarcfiter, Jayme L.COMPUTATIONAL RESULTSEXACT ALGORITHMSINSTANCE GENERATIONPERFECT EDGE DOMINATIONhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1A formulation is proposed for the perfect edge domination problem and some exact algorithms based on it are designed and tested. So far, perfect edge domination has been investigated mostly in computational complexity terms. Indeed, we could find no previous explicit mathematical formulation or exact algorithm for the problem. Furthermore, testing our algorithms also represented a challenge. Standard randomly generated graphs tend to contain a single perfect edge dominating solution, i.e., the trivial one, containing all edges in the graph. Accordingly, some quite elaborated procedures had to be devised to have access to more challenging instances. A total of 736 graphs were thus generated, all of them containing feasible solutions other than the trivial ones. Every graph giving rise to a weighted and a non weighted instance, all instances solved to proven optimality by two of the algorithms tested.Fil: do Forte, Vinicius L.. Universidade Federal Rural do Rio de Janeiro; BrasilFil: Lin, Min Chih. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; ArgentinaFil: Lucena, Abilio. Universidade Federal do Rio de Janeiro; BrasilFil: Maculan, Nelson. Universidade Federal do Rio de Janeiro; BrasilFil: Moyano, Verónica Andrea. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; ArgentinaFil: Szwarcfiter, Jayme L.. Universidade do Estado de Rio do Janeiro; Brasil. Universidade Federal do Rio de Janeiro; BrasilSpringer Heidelberg2018-10info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/92974do Forte, Vinicius L.; Lin, Min Chih; Lucena, Abilio; Maculan, Nelson; Moyano, Verónica Andrea; et al.; Modelling and solving the perfect edge domination problem; Springer Heidelberg; Optimization Letters; 10-20181862-4472CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs11590-018-1335-xinfo:eu-repo/semantics/altIdentifier/doi/10.1007/s11590-018-1335-xinfo: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-29T09:36:38Zoai:ri.conicet.gov.ar:11336/92974instacron: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-29 09:36:38.54CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
Modelling and solving the perfect edge domination problem |
title |
Modelling and solving the perfect edge domination problem |
spellingShingle |
Modelling and solving the perfect edge domination problem do Forte, Vinicius L. COMPUTATIONAL RESULTS EXACT ALGORITHMS INSTANCE GENERATION PERFECT EDGE DOMINATION |
title_short |
Modelling and solving the perfect edge domination problem |
title_full |
Modelling and solving the perfect edge domination problem |
title_fullStr |
Modelling and solving the perfect edge domination problem |
title_full_unstemmed |
Modelling and solving the perfect edge domination problem |
title_sort |
Modelling and solving the perfect edge domination problem |
dc.creator.none.fl_str_mv |
do Forte, Vinicius L. Lin, Min Chih Lucena, Abilio Maculan, Nelson Moyano, Verónica Andrea Szwarcfiter, Jayme L. |
author |
do Forte, Vinicius L. |
author_facet |
do Forte, Vinicius L. Lin, Min Chih Lucena, Abilio Maculan, Nelson Moyano, Verónica Andrea Szwarcfiter, Jayme L. |
author_role |
author |
author2 |
Lin, Min Chih Lucena, Abilio Maculan, Nelson Moyano, Verónica Andrea Szwarcfiter, Jayme L. |
author2_role |
author author author author author |
dc.subject.none.fl_str_mv |
COMPUTATIONAL RESULTS EXACT ALGORITHMS INSTANCE GENERATION PERFECT EDGE DOMINATION |
topic |
COMPUTATIONAL RESULTS EXACT ALGORITHMS INSTANCE GENERATION PERFECT EDGE DOMINATION |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
dc.description.none.fl_txt_mv |
A formulation is proposed for the perfect edge domination problem and some exact algorithms based on it are designed and tested. So far, perfect edge domination has been investigated mostly in computational complexity terms. Indeed, we could find no previous explicit mathematical formulation or exact algorithm for the problem. Furthermore, testing our algorithms also represented a challenge. Standard randomly generated graphs tend to contain a single perfect edge dominating solution, i.e., the trivial one, containing all edges in the graph. Accordingly, some quite elaborated procedures had to be devised to have access to more challenging instances. A total of 736 graphs were thus generated, all of them containing feasible solutions other than the trivial ones. Every graph giving rise to a weighted and a non weighted instance, all instances solved to proven optimality by two of the algorithms tested. Fil: do Forte, Vinicius L.. Universidade Federal Rural do Rio de Janeiro; Brasil Fil: Lin, Min Chih. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina Fil: Lucena, Abilio. Universidade Federal do Rio de Janeiro; Brasil Fil: Maculan, Nelson. Universidade Federal do Rio de Janeiro; Brasil Fil: Moyano, Verónica Andrea. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina Fil: Szwarcfiter, Jayme L.. Universidade do Estado de Rio do Janeiro; Brasil. Universidade Federal do Rio de Janeiro; Brasil |
description |
A formulation is proposed for the perfect edge domination problem and some exact algorithms based on it are designed and tested. So far, perfect edge domination has been investigated mostly in computational complexity terms. Indeed, we could find no previous explicit mathematical formulation or exact algorithm for the problem. Furthermore, testing our algorithms also represented a challenge. Standard randomly generated graphs tend to contain a single perfect edge dominating solution, i.e., the trivial one, containing all edges in the graph. Accordingly, some quite elaborated procedures had to be devised to have access to more challenging instances. A total of 736 graphs were thus generated, all of them containing feasible solutions other than the trivial ones. Every graph giving rise to a weighted and a non weighted instance, all instances solved to proven optimality by two of the algorithms tested. |
publishDate |
2018 |
dc.date.none.fl_str_mv |
2018-10 |
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/92974 do Forte, Vinicius L.; Lin, Min Chih; Lucena, Abilio; Maculan, Nelson; Moyano, Verónica Andrea; et al.; Modelling and solving the perfect edge domination problem; Springer Heidelberg; Optimization Letters; 10-2018 1862-4472 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/92974 |
identifier_str_mv |
do Forte, Vinicius L.; Lin, Min Chih; Lucena, Abilio; Maculan, Nelson; Moyano, Verónica Andrea; et al.; Modelling and solving the perfect edge domination problem; Springer Heidelberg; Optimization Letters; 10-2018 1862-4472 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs11590-018-1335-x info:eu-repo/semantics/altIdentifier/doi/10.1007/s11590-018-1335-x |
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 |
dc.publisher.none.fl_str_mv |
Springer Heidelberg |
publisher.none.fl_str_mv |
Springer Heidelberg |
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_ |
1844613150864834560 |
score |
13.070432 |