Aplica？？o do algoritmo volumétrico à resolu？？o aproximada e exacta do problema do caixeiro viajante assimétrico

in this paper we present computational results with the volume algorithm, a variant of the subgradient method, when solving the linear relaxation that stems from the extended disaggregated flow formulation of the asymmetric travelling salesman problems. computational experiments were performed on a selection of instances from the tsplib and some randomly generated instances according to the dimacs implementation challenge. we have also tried atsp heuristics within the volume algorithm. computational experiments show moderated success on medium-scale instances.