The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k \(≥\) 5
Type
Phuc Hung Hoang
Phuc Hung Hoang is a Project Assistant at the Algorithms and Complexity Group.
Phuc Hung Hoang is a Project Assistant at the Algorithms and Complexity Group.