Sciweavers

40 search results - page 3 / 8
» The On-line Asymmetric Traveling Salesman Problem
Sort
View
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
13 years 9 months ago
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
Thành Nguyen
IJCAI
2003
13 years 8 months ago
Phase Transitions of the Asymmetric Traveling Salesman
We empirically study phase transitions of the asymmetric Traveling Salesman. Using random instances of up to 1,500 cities, we show that many properties of the problem, including t...
Weixiong Zhang
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
13 years 8 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
ICEC
1996
123views more  ICEC 1996»
13 years 8 months ago
Solving Symmetric and Asymmetric TSPs by Ant Colonies
- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We a...
Luca Maria Gambardella, Marco Dorigo
WADS
2005
Springer
78views Algorithms» more  WADS 2005»
14 years 28 days ago
The On-line Asymmetric Traveling Salesman Problem
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura