Computational methods for logistics problems related to optimal trees
Wu, Longshu ; Wang, Qin ; Yang, Xiaobing
ANZIAM Journal, Tome 58 (2017), / Harvested from Australian Mathematical Society
Link

In recent years, balanced network optimization problems play an important role in practice, especially in information transmission, industry production and logistics management. In this paper, we consider some logistics optimization problems related to the optimal tree structures in a network. We show that the most optimal subtree problem is NP-hard by transforming the connected dominating set problem into this model. By constructing the network models of the most balanced spanning tree problem with edge set restrictions, and by finding the optimal subtrees in special networks, we present efficient computational methods for solving some logistics problems. doi:10.1017/S1446181117000074

Publié le : 2017-01-01
DOI : https://doi.org/10.21914/anziamj.v58i0.11079 
@article{11079,
     title = {Computational methods for logistics problems related to optimal trees},
     journal = {ANZIAM Journal},
     volume = {58},
     year = {2017},
     doi = {10.21914/anziamj.v58i0.11079},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/11079}
}

Wu, Longshu; Wang, Qin; Yang, Xiaobing. Computational methods for logistics problems related to optimal trees. ANZIAM Journal, Tome 58 (2017) . doi : 10.21914/anziamj.v58i0.11079. http://gdmltest.u-ga.fr/item/11079/