Gregory Gutin, Anders Yeo Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:119, n:1-2, pp:107-116 [Journal]

David Blokh, Eugene Levner An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:119, n:1-2, pp:139-148 [Journal]

Santosh N. Kabadi New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:119, n:1-2, pp:149-167 [Journal]

Johann Hurink, Sigrid Knust A tabu search algorithm for scheduling a single robot in a job-shop environment. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:119, n:1-2, pp:181-203 [Journal]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP