Um melhor limite inferior para o problema do caixeiro viajante assimétrico baseado no problema da afecta？？o

in this article we decribe how to compute a lower bound for the asymmetric traveling salesman problem that dominates the bound that comes from the assignment relaxation, through the solving of a sequence of assignment problems. the algorithm that we propose is a first-order method based on the exponential penalty function. directions of movement are derived from a disjunctive relaxation that we proposed as being one of two possible classes, one based on cycles, the other based on cliques.