Publisher
Springer International Publishing
Reference20 articles.
1. Binh, H.T.T., Thanh, P.D., Thang, T.B.: New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm. Knowl.-Based Syst. 180, 12–25 (2019)
2. Huynh Thi Thanh, B., Pham Dinh, T.: Two levels approach based on multifactorial optimization to solve the clustered shortest path tree problem. Evol. Intell. 15(1), 185–213 (2020). https://doi.org/10.1007/s12065-020-00501-w
3. Cosma, O., Pop, P.C., Zelina, I.: An effective genetic algorithm for solving the clustered shortest-path tree problem. IEEE Access 9, 15570–15591 (2021)
4. Cosma, O., Pop, P.C., Zelina, I.: A novel genetic algorithm for solving the clustered shortest-path tree problem. Carpathian J. Math. 36(3), 401–414 (2020)
5. D’Emidio, M., Forlizzi, L., Frigioni, D., Leucci, S., Proietti, G.: On the clustered shortest-path tree problem. In: Proceedings of Italian Conference on Theoretical Computer Science, pp. 263–268 (2016)