%0 Journal Article
%T Um melhor limite inferior para o problema do caixeiro viajante assim¨¦trico baseado no problema da afecta£¿£¿o
%A Ramires
%A Ana
%A Soares
%A Jo£¿o
%J Investiga£¿£¿o Operacional
%D 2005
%I Scientific Electronic Library Online
%X 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.
%K optimization
%K combinatorial optimization
%K lower bounds
%K asymmetric traveling salesman
%K disjunctive programming.
%U http://www.scielo.gpeari.mctes.pt/scielo.php?script=sci_abstract&pid=S0874-51612005000100004&lng=en&nrm=iso&tlng=en