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

Uchoa, EduardoToffolo, Túlio Ângelo MachadoSouza, Maurício Cardoso deMartins, Alexandre Xavier2012-10-092012-10-092009UCHOA, 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 instancesen-USCapacitated spanning treeBranch-and-cutSubproblem optimizationBranch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem.Trabalho apresentado em evento