A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code

Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Ioana Zelina. A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code. In Pablo García Bringas, Hilde Pérez García, Francisco Javier Martínez de Pisón, José Ramón Villar Flecha, Alicia Troncoso Lora, Enrique A. de la Cal, Álvaro Herrero 0001, Francisco Martínez-Álvarez, Giuseppe Psaila, Héctor Quintián, Emilio Corchado, editors, Hybrid Artificial Intelligent Systems - 17th International Conference, HAIS 2022, Salamanca, Spain, September 5-7, 2022, Proceedings. Volume 13469 of Lecture Notes in Computer Science, pages 323-334, Springer, 2022. [doi]

@inproceedings{PetrovanPSZ22,
  title = {A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code},
  author = {Adrian Petrovan and Petrica C. Pop and Cosmin Sabo and Ioana Zelina},
  year = {2022},
  doi = {10.1007/978-3-031-15471-3_28},
  url = {https://doi.org/10.1007/978-3-031-15471-3_28},
  researchr = {https://researchr.org/publication/PetrovanPSZ22},
  cites = {0},
  citedby = {0},
  pages = {323-334},
  booktitle = {Hybrid Artificial Intelligent Systems - 17th International Conference, HAIS 2022, Salamanca, Spain, September 5-7, 2022, Proceedings},
  editor = {Pablo García Bringas and Hilde Pérez García and Francisco Javier Martínez de Pisón and José Ramón Villar Flecha and Alicia Troncoso Lora and Enrique A. de la Cal and Álvaro Herrero 0001 and Francisco Martínez-Álvarez and Giuseppe Psaila and Héctor Quintián and Emilio Corchado},
  volume = {13469},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-031-15471-3},
}