A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization

Huynh Thi Thanh Binh, Ta Bao Thang, Nguyen Duc Thai, Pham Dinh Thanh. A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization. Eng. Appl. of AI, 100:104187, 2021. [doi]

@article{BinhTTT21,
  title = {A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization},
  author = {Huynh Thi Thanh Binh and Ta Bao Thang and Nguyen Duc Thai and Pham Dinh Thanh},
  year = {2021},
  doi = {10.1016/j.engappai.2021.104187},
  url = {https://doi.org/10.1016/j.engappai.2021.104187},
  researchr = {https://researchr.org/publication/BinhTTT21},
  cites = {0},
  citedby = {0},
  journal = {Eng. Appl. of AI},
  volume = {100},
  pages = {104187},
}