|
|||||
|
|
Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem |
|
| Authors: | da Cunha Alexandre Salles |
| Affiliation: | 1.Departamento de Ciência da Computa??o, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil ; |
| Abstract: | Journal of Combinatorial Optimization - The Angular Constrained Minimum Spanning Tree Problem ( $$\alpha $$ -MSTP) is defined in terms of a complete undirected graph $$G=(V,E)$$ and an angle... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |