3 search results - page 1 / 1 » When is the Assignment Bound Tight for the Asymmetric Travel... |
IPCO
1992
13 years 6 months ago
1992
We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume ...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
AI
2006
Springer
13 years 5 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...