Pham Trung Kien

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand and distance between each pair of nodes. This paper presents a Hybrid Genetic Algorithm (HGA) combining the basic GA with the ideas of the Particle Swarm Optimization (PSO)(More)
  • 1