A novel genetic algorithm for solving the clustered shortest-path tree problem
From MaRDI portal
Publication:3384537
DOI10.37193/CJM.2020.03.08zbMath1499.90278OpenAlexW3134634344WikidataQ113999585 ScholiaQ113999585MaRDI QIDQ3384537
Petrică C. Pop, Ovidiu Cosma, Ioana Zelina
Publication date: 15 December 2021
Published in: Carpathian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37193/cjm.2020.03.08
Approximation methods and heuristics in mathematical programming (90C59) Paths and cycles (05C38) Distance in graphs (05C12) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items