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_bfda0a01fc3da508dbe149308d6ed3bd
oai_identifier_str oai:localhost:123456789/1589
network_acronym_str UFOP
network_name_str Repositório Institucional da UFOP
repository_id_str 3233
spelling Uchoa, EduardoToffolo, Túlio Ângelo MachadoSouza, Maurício Cardoso deMartins, Alexandre Xavier2012-10-09T18:10:20Z2012-10-09T18:10:20Z2009UCHOA, 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/1589We 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 instancesCapacitated spanning treeBranch-and-cutSubproblem optimizationBranch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem.info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjectengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOPinfo:eu-repo/semantics/openAccessLICENSElicense.txtlicense.txttext/plain; charset=utf-81748http://www.repositorio.ufop.br/bitstream/123456789/1589/5/license.txt8a4605be74aa9ea9d79846c1fba20a33MD55ORIGINALEVENTO_BranchCcutGrasp.pdfEVENTO_BranchCcutGrasp.pdfapplication/pdf116094http://www.repositorio.ufop.br/bitstream/123456789/1589/1/EVENTO_BranchCcutGrasp.pdf1482b5e2065469f7305e719caf9f52dcMD51123456789/15892019-03-11 13:51:33.422oai:localhost:123456789/1589Tk9URTogUExBQ0UgWU9VUiBPV04gTElDRU5TRSBIRVJFClRoaXMgc2FtcGxlIGxpY2Vuc2UgaXMgcHJvdmlkZWQgZm9yIGluZm9ybWF0aW9uYWwgcHVycG9zZXMgb25seS4KCk5PTi1FWENMVVNJVkUgRElTVFJJQlVUSU9OIExJQ0VOU0UKCkJ5IHNpZ25pbmcgYW5kIHN1Ym1pdHRpbmcgdGhpcyBsaWNlbnNlLCB5b3UgKHRoZSBhdXRob3Iocykgb3IgY29weXJpZ2h0Cm93bmVyKSBncmFudHMgdG8gRFNwYWNlIFVuaXZlcnNpdHkgKERTVSkgdGhlIG5vbi1leGNsdXNpdmUgcmlnaHQgdG8gcmVwcm9kdWNlLAp0cmFuc2xhdGUgKGFzIGRlZmluZWQgYmVsb3cpLCBhbmQvb3IgZGlzdHJpYnV0ZSB5b3VyIHN1Ym1pc3Npb24gKGluY2x1ZGluZwp0aGUgYWJzdHJhY3QpIHdvcmxkd2lkZSBpbiBwcmludCBhbmQgZWxlY3Ryb25pYyBmb3JtYXQgYW5kIGluIGFueSBtZWRpdW0sCmluY2x1ZGluZyBidXQgbm90IGxpbWl0ZWQgdG8gYXVkaW8gb3IgdmlkZW8uCgpZb3UgYWdyZWUgdGhhdCBEU1UgbWF5LCB3aXRob3V0IGNoYW5naW5nIHRoZSBjb250ZW50LCB0cmFuc2xhdGUgdGhlCnN1Ym1pc3Npb24gdG8gYW55IG1lZGl1bSBvciBmb3JtYXQgZm9yIHRoZSBwdXJwb3NlIG9mIHByZXNlcnZhdGlvbi4KCllvdSBhbHNvIGFncmVlIHRoYXQgRFNVIG1heSBrZWVwIG1vcmUgdGhhbiBvbmUgY29weSBvZiB0aGlzIHN1Ym1pc3Npb24gZm9yCnB1cnBvc2VzIG9mIHNlY3VyaXR5LCBiYWNrLXVwIGFuZCBwcmVzZXJ2YXRpb24uCgpZb3UgcmVwcmVzZW50IHRoYXQgdGhlIHN1Ym1pc3Npb24gaXMgeW91ciBvcmlnaW5hbCB3b3JrLCBhbmQgdGhhdCB5b3UgaGF2ZQp0aGUgcmlnaHQgdG8gZ3JhbnQgdGhlIHJpZ2h0cyBjb250YWluZWQgaW4gdGhpcyBsaWNlbnNlLiBZb3UgYWxzbyByZXByZXNlbnQKdGhhdCB5b3VyIHN1Ym1pc3Npb24gZG9lcyBub3QsIHRvIHRoZSBiZXN0IG9mIHlvdXIga25vd2xlZGdlLCBpbmZyaW5nZSB1cG9uCmFueW9uZSdzIGNvcHlyaWdodC4KCklmIHRoZSBzdWJtaXNzaW9uIGNvbnRhaW5zIG1hdGVyaWFsIGZvciB3aGljaCB5b3UgZG8gbm90IGhvbGQgY29weXJpZ2h0LAp5b3UgcmVwcmVzZW50IHRoYXQgeW91IGhhdmUgb2J0YWluZWQgdGhlIHVucmVzdHJpY3RlZCBwZXJtaXNzaW9uIG9mIHRoZQpjb3B5cmlnaHQgb3duZXIgdG8gZ3JhbnQgRFNVIHRoZSByaWdodHMgcmVxdWlyZWQgYnkgdGhpcyBsaWNlbnNlLCBhbmQgdGhhdApzdWNoIHRoaXJkLXBhcnR5IG93bmVkIG1hdGVyaWFsIGlzIGNsZWFybHkgaWRlbnRpZmllZCBhbmQgYWNrbm93bGVkZ2VkCndpdGhpbiB0aGUgdGV4dCBvciBjb250ZW50IG9mIHRoZSBzdWJtaXNzaW9uLgoKSUYgVEhFIFNVQk1JU1NJT04gSVMgQkFTRUQgVVBPTiBXT1JLIFRIQVQgSEFTIEJFRU4gU1BPTlNPUkVEIE9SIFNVUFBPUlRFRApCWSBBTiBBR0VOQ1kgT1IgT1JHQU5JWkFUSU9OIE9USEVSIFRIQU4gRFNVLCBZT1UgUkVQUkVTRU5UIFRIQVQgWU9VIEhBVkUKRlVMRklMTEVEIEFOWSBSSUdIVCBPRiBSRVZJRVcgT1IgT1RIRVIgT0JMSUdBVElPTlMgUkVRVUlSRUQgQlkgU1VDSApDT05UUkFDVCBPUiBBR1JFRU1FTlQuCgpEU1Ugd2lsbCBjbGVhcmx5IGlkZW50aWZ5IHlvdXIgbmFtZShzKSBhcyB0aGUgYXV0aG9yKHMpIG9yIG93bmVyKHMpIG9mIHRoZQpzdWJtaXNzaW9uLCBhbmQgd2lsbCBub3QgbWFrZSBhbnkgYWx0ZXJhdGlvbiwgb3RoZXIgdGhhbiBhcyBhbGxvd2VkIGJ5IHRoaXMKbGljZW5zZSwgdG8geW91ciBzdWJtaXNzaW9uLgo=Repositó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.pt_BR.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.issued.fl_str_mv 2009
dc.date.accessioned.fl_str_mv 2012-10-09T18:10:20Z
dc.date.available.fl_str_mv 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.citation.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.
dc.identifier.uri.fl_str_mv 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.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
bitstream.url.fl_str_mv http://www.repositorio.ufop.br/bitstream/123456789/1589/5/license.txt
http://www.repositorio.ufop.br/bitstream/123456789/1589/1/EVENTO_BranchCcutGrasp.pdf
bitstream.checksum.fl_str_mv 8a4605be74aa9ea9d79846c1fba20a33
1482b5e2065469f7305e719caf9f52dc
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
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_ 1801685707916312576

Registros relacionados