A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem
Published in 2019 IEEE Congress on Evolutionary Computation (CEC), 2019
Recommended citation: Thanh, P. D., Binh, H. T. T., & Long, N. B. (2019, June). "A heuristic based on randomized greedy algorithms for the clustered shortest-path tree problem." In 2019 IEEE Congress on Evolutionary Computation (CEC) (pp. 2915-2922). IEEE.
Download Paper