Por favor, use este identificador para citar o enlazar este ítem:
http://www.repositorio.ufop.br/jspui/handle/123456789/1589
Título : | Branch-and-cut and GRASP with hybrid local search for the multi-level capacitated minimum spanning tree problem. |
Autor : | Uchoa, Eduardo Toffolo, Túlio Ângelo Machado Souza, Maurício Cardoso de Martins, Alexandre Xavier |
Palabras clave : | Capacitated spanning tree Branch-and-cut Subproblem optimization |
Fecha de publicación : | 2009 |
Citación : | 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. |
Resumen : | 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 |
URI : | http://www.repositorio.ufop.br/handle/123456789/1589 |
Aparece en las colecciones: | DECEA - Trabalhos apresentados em eventos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
EVENTO_BranchCcutGrasp.pdf | 113,37 kB | Adobe PDF | Visualizar/Abrir |
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.