Sciweavers

11 search results - page 1 / 3
» Probabilistic Traveling Salesman Problem with Deadlines
Sort
View
TRANSCI
2008
85views more  TRANSCI 2008»
13 years 4 months ago
Probabilistic Traveling Salesman Problem with Deadlines
Ann Melissa Campbell, Barrett W. Thomas
EUROCAST
2009
Springer
179views Hardware» more  EUROCAST 2009»
13 years 11 months ago
New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
Dennis Weyland, Leonora Bianchi, Luca Maria Gambar...
IPCO
1992
115views Optimization» more  IPCO 1992»
13 years 6 months ago
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?
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 ...
Alan M. Frieze, Richard M. Karp, Bruce A. Reed
COR
2006
140views more  COR 2006»
13 years 4 months ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell