Computational methods for logistics problems related to optimal trees

Longshu Wu, Qin Wang, Xiaobing Yang

Abstract


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

Keywords


computational method, spanning tree, polynomial algorithm, nondeterministic polynomial-time (NP)-hard.



DOI: http://dx.doi.org/10.21914/anziamj.v58i0.11079



Remember, for most actions you have to record/upload into this online system
and then inform the editor/author via clicking on an email icon or Completion button.
ANZIAM Journal, ISSN 1446-8735, copyright Australian Mathematical Society.