Resumo

RAMIRES, Ana  e  SOARES, João. An improved lower bound for the asymmetric traveling salesman problem based on the assignment problem. Inv. Op. [online]. 2005, vol.25, n.1, pp.63-83. ISSN 0874-5161.

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.

Palavras-chave : Optimization; Combinatorial Optimization; Lower Bounds; Asymmetric Traveling Salesman; Disjunctive Programming.

        · resumo em Português     · texto em Português     · Português ( pdf )