Complexity and Routing Problems
C#
1
Posts
1
Posters
0
Views
1
Watching
-
Hello, I know that the Traveling Salesman Problem has a solution space of (n-1)! / 2 for n = nodes, when the symetrick TSP is considered. But, is there any mathematical way to show how big a solution space a Arc Routing Problem, like the Capacitated Arc Routing Problem have? Or any other way to show (describe) why ít is a complex problem? In all the literature it is only described as NP-hard, and thats it. Thanks