Improves adjacency matrix conditioning by scaling the cost according to the problem size. If necessary will enlarge cost as much as possible such that small differences are visible at integer resolution. However, will only increase cost up to upper bound such that GTSP solver does not overflow.
rikba
commented
2 years ago
Improves adjacency matrix conditioning by scaling the cost according to the problem size. If necessary will enlarge cost as much as possible such that small differences are visible at integer resolution. However, will only increase cost up to upper bound such that GTSP solver does not overflow.