Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem.

Detalhes bibliográficos
Autor(a) principal: Uchoa, Eduardo
Data de Publicação: 2009
Outros Autores: Toffolo, Túlio Ângelo Machado, Souza, Maurício Cardoso de, Martins, Alexandre Xavier
Tipo de documento: Artigo de conferência
Idioma: eng
Título da fonte: Repositório Institucional da UFOP
Texto Completo: http://www.repositorio.ufop.br/handle/123456789/1589
Resumo: We propose efficient algorithms to compute tight lower bounds and high quality upper bounds for the Multi-Level Capacitated Minimum Spanning Tree problem. We first develop a branch-and-cut algorithm for the problem. This algorithm is able to solve instances of medium size and to provide tight lower bounds for larger ones. We then use the branch-and-cut within GRASP to evaluate subproblems during the search. The computational experiments conducted have improved best known lower and upper bounds on benchmark instances
id UFOP_df70d1b2a644119a60ee0436abb1b35e
oai_identifier_str oai:repositorio.ufop.br:123456789/1589
network_acronym_str UFOP
network_name_str Repositório Institucional da UFOP
repository_id_str 3233
spelling Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem.Capacitated spanning treeBranch-and-cutSubproblem optimizationWe propose efficient algorithms to compute tight lower bounds and high quality upper bounds for the Multi-Level Capacitated Minimum Spanning Tree problem. We first develop a branch-and-cut algorithm for the problem. This algorithm is able to solve instances of medium size and to provide tight lower bounds for larger ones. We then use the branch-and-cut within GRASP to evaluate subproblems during the search. The computational experiments conducted have improved best known lower and upper bounds on benchmark instances2012-10-09T18:10:20Z2012-10-09T18:10:20Z2009info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjectapplication/pdfUCHOA, E. et al. Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem. In. International Network Optimization Conference (INOC), 2009. Pisa. Anais... Pisa: INOC, 2009. Disponível em: <http://www.di.unipi.it/optimize/Events/proceedings/M/D/2/MD2-2.pdf>. Acesso em: 10 out. 2012.http://www.repositorio.ufop.br/handle/123456789/1589Uchoa, EduardoToffolo, Túlio Ângelo MachadoSouza, Maurício Cardoso deMartins, Alexandre Xavierengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOPinfo:eu-repo/semantics/openAccess2019-03-11T17:51:33Zoai:repositorio.ufop.br:123456789/1589Repositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332019-03-11T17:51:33Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false
dc.title.none.fl_str_mv Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem.
title Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem.
spellingShingle Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem.
Uchoa, Eduardo
Capacitated spanning tree
Branch-and-cut
Subproblem optimization
title_short Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem.
title_full Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem.
title_fullStr Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem.
title_full_unstemmed Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem.
title_sort Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem.
author Uchoa, Eduardo
author_facet Uchoa, Eduardo
Toffolo, Túlio Ângelo Machado
Souza, Maurício Cardoso de
Martins, Alexandre Xavier
author_role author
author2 Toffolo, Túlio Ângelo Machado
Souza, Maurício Cardoso de
Martins, Alexandre Xavier
author2_role author
author
author
dc.contributor.author.fl_str_mv Uchoa, Eduardo
Toffolo, Túlio Ângelo Machado
Souza, Maurício Cardoso de
Martins, Alexandre Xavier
dc.subject.por.fl_str_mv Capacitated spanning tree
Branch-and-cut
Subproblem optimization
topic Capacitated spanning tree
Branch-and-cut
Subproblem optimization
description We propose efficient algorithms to compute tight lower bounds and high quality upper bounds for the Multi-Level Capacitated Minimum Spanning Tree problem. We first develop a branch-and-cut algorithm for the problem. This algorithm is able to solve instances of medium size and to provide tight lower bounds for larger ones. We then use the branch-and-cut within GRASP to evaluate subproblems during the search. The computational experiments conducted have improved best known lower and upper bounds on benchmark instances
publishDate 2009
dc.date.none.fl_str_mv 2009
2012-10-09T18:10:20Z
2012-10-09T18:10:20Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/conferenceObject
format conferenceObject
status_str publishedVersion
dc.identifier.uri.fl_str_mv UCHOA, E. et al. Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem. In. International Network Optimization Conference (INOC), 2009. Pisa. Anais... Pisa: INOC, 2009. Disponível em: <http://www.di.unipi.it/optimize/Events/proceedings/M/D/2/MD2-2.pdf>. Acesso em: 10 out. 2012.
http://www.repositorio.ufop.br/handle/123456789/1589
identifier_str_mv UCHOA, E. et al. Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem. In. International Network Optimization Conference (INOC), 2009. Pisa. Anais... Pisa: INOC, 2009. Disponível em: <http://www.di.unipi.it/optimize/Events/proceedings/M/D/2/MD2-2.pdf>. Acesso em: 10 out. 2012.
url http://www.repositorio.ufop.br/handle/123456789/1589
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFOP
instname:Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP
instname_str Universidade Federal de Ouro Preto (UFOP)
instacron_str UFOP
institution UFOP
reponame_str Repositório Institucional da UFOP
collection Repositório Institucional da UFOP
repository.name.fl_str_mv Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)
repository.mail.fl_str_mv repositorio@ufop.edu.br
_version_ 1813002799186706432

Registros relacionados