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

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorUchoa, Eduardo-
Autor(es): dc.creatorToffolo, Túlio Ângelo Machado-
Autor(es): dc.creatorSouza, Maurício Cardoso de-
Autor(es): dc.creatorMartins, Alexandre Xavier-
Data de aceite: dc.date.accessioned2019-11-06T13:25:16Z-
Data de disponibilização: dc.date.available2019-11-06T13:25:16Z-
Data de envio: dc.date.issued2012-10-09-
Data de envio: dc.date.issued2012-10-09-
Data de envio: dc.date.issued2009-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/123456789/1589-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/555020-
Descrição: dc.descriptionWe 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-
Idioma: dc.languageen-
Palavras-chave: dc.subjectCapacitated spanning tree-
Palavras-chave: dc.subjectBranch-and-cut-
Palavras-chave: dc.subjectGRASP-
Palavras-chave: dc.subjectSubproblem optimization-
Título: dc.titleBranch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.