This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
-- | |
-- A solution to the Asymmetric traveling salesman problem | |
-- using pgr_tsp. | |
-- | |
-- Solution is to rewrite the distance matrix in to inverse copy and | |
-- link the two copies of a town together by a zero link route. | |
-- | |
-- See http://en.wikipedia.org/wiki/Traveling_salesman_problem#Solving_by_conversion_to_symmetric_TSP | |
-- for the details. | |
-- |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
postgres sql |