National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
Zlepšený aproximační algoritmus pro asymetrický problém obchodního cestujícího
Blaser, M. ; Manthey, B. ; Sgall, Jiří
We consider the asymmetric traveling salesperson problem with /gamma-parameterized triangle inequality Chandran and Ram recently gave the first constant factor approximation algorithm with polynomial running time for this problem. We devise an approximation algorithm, which is better than the one of Chandran and Ram for /gamma in [0.5437,1).

Interested in being notified about new results for this query?
Subscribe to the RSS feed.