Sciweavers

599 search results - page 15 / 120
» The traveling salesman problem
Sort
View
DISOPT
2010
138views more  DISOPT 2010»
13 years 8 months ago
The Delivery Man Problem with time windows
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
Géraldine Heilporn, Jean-François Co...
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
14 years 5 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
ESA
2005
Springer
98views Algorithms» more  ESA 2005»
14 years 1 months ago
Improved Approximation Algorithms for Metric Max TSP
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
Zhi-Zhong Chen, Takayuki Nagoya
IJCAI
2003
13 years 9 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
GI
2007
Springer
14 years 2 months ago
The Collaborative Carrier Vehicle Routing Problem for Capacitated Traveling Salesman Tours
Abstract: This paper concentrates on a new framework for a post-market reassignment of requests in a Collaborative Carrier Network (CCN). While the framework was applied to a picku...
Susanne Berger, Christian Bierwirth