Cite
Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem.
MLA
Petrovan, Adrian, et al. “Novel Two-Level Hybrid Genetic Algorithms Based on Different Cayley-Type Encodings for Solving the Clustered Shortest-Path Tree Problem.” Expert Systems with Applications, vol. 215, Apr. 2023, p. N.PAG. EBSCOhost, https://doi.org/10.1016/j.eswa.2022.119372.
APA
Petrovan, A., Pop, P., Sabo, C., & Zelina, I. (2023). Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem. Expert Systems with Applications, 215, N.PAG. https://doi.org/10.1016/j.eswa.2022.119372
Chicago
Petrovan, Adrian, Petrică Pop, Cosmin Sabo, and Ioana Zelina. 2023. “Novel Two-Level Hybrid Genetic Algorithms Based on Different Cayley-Type Encodings for Solving the Clustered Shortest-Path Tree Problem.” Expert Systems with Applications 215 (April): N.PAG. doi:10.1016/j.eswa.2022.119372.