In this paper, we study a subproblem of vehicle scheduling problem, which is in general strongly NP-hard. In this problem, the road map is a tree, the release times and the handling times of all the...
CITATION STYLE
Zhou, J., Bu, T., Zhu, H., & Chen, Y. (2013). Vehicle Scheduling Problem on Trees (pp. 535–541). https://doi.org/10.1007/978-3-642-37502-6_64
Mendeley helps you to discover research relevant for your work.