Efficient heuristic algorithm for identifying critical nodes in planar networks

  • Gang Cui
  • Dalaijargal Purevusren
    • Categories Combinatorial Optimization, Network Optimization Tags , , , , Short URL: https://optimization-online.org/?p=15356

    This paper presents a new method for identifying critical nodes in planar networks. We propose an efficient method to evaluate the quality of solutions by using special properties of planar networks. It enables us to develop a computationally efficient heuristic algorithm for the problem. The proposed algorithm assisted on randomly generated planar networks. The experimental results are reported.

    Citation

    1, Harbin Institute of Technology, 07/2018

    Article

    Download

    View Efficient heuristic algorithm for identifying critical nodes in planar networks