D Purevsuren, G Gombojav - Available at SSRN 4395204, 2023 - papers.ssrn.com
This paper presents two heuristic algorithms for the distance-based critical node problem (DCNP) that finds k nodes whose removalminimizes the pairwise connection within D hops …
The travelling salesman problem is one of the well-known NP-hard problems, and there are various versions of the problem with respect to its different specifications of the constraints …