A novel genetic algorithm for solving the clustered shortest-path tree problem
From MaRDI portal
Publication:3384537
Recommendations
- Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
- Using genetic algorithm solving shortest path problem
- A two-level solution approach for solving the generalized minimum spanning tree problem
- The prize-collecting generalized minimum spanning tree problem
Cited in
(6)- Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
- Using genetic algorithm solving shortest path problem
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- A comprehensive survey on the generalized traveling salesman problem
- Competition between Dandelion and Prüfer encoded genetic algorithms for solving the clustered minimum routing tree problem
This page was built for publication: A novel genetic algorithm for solving the clustered shortest-path tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384537)