A local search heuristic for bounded-degree minimum spanning trees
Article
Zahrani, M., Loomes, M., Malcolm, J. and Albrecht, A. 2008. A local search heuristic for bounded-degree minimum spanning trees. Engineering Optimization. 40 (12), pp. 1115-1135. https://doi.org/10.1080/03052150802317440
| Type | Article |
|---|---|
| Title | A local search heuristic for bounded-degree minimum spanning trees |
| Authors | Zahrani, M., Loomes, M., Malcolm, J. and Albrecht, A. |
| Abstract | The bounded-degree minimum spanning tree (BDMST) problem has many practical applications. Unlike |
| Research Group | SensoLab group |
| Publisher | Taylor and Francis |
| Journal | Engineering Optimization |
| ISSN | 0305-215X |
| Publication dates | |
| Dec 2008 | |
| Publication process dates | |
| Deposited | 31 Mar 2010 |
| Output status | Published |
| Digital Object Identifier (DOI) | https://doi.org/10.1080/03052150802317440 |
| Language | English |
https://repository.mdx.ac.uk/item/826w8
122
total views0
total downloads7
views this month0
downloads this month