Search Sciweavers | Sciweavers

13 search results - page 1 / 3

» Aggregation for the probabilistic traveling salesman problem

click to vote

COR
2006

140views more COR 2006»

Aggregation for the probabilistic traveling salesman problem

13 years 11 months ago

Download myweb.uiowa.edu

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

claim paper

Read More »

click to vote

EUROCAST
2009
Springer

179views Hardware» more EUROCAST 2009»

New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem

14 years 5 months ago

Download www.idsia.ch

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...

claim paper

Read More »

click to vote

IPCO
1992

115views Optimization» more IPCO 1992»

When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?

14 years 10 days ago

Download www.math.cmu.edu

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

claim paper

Read More »

click to vote

TRANSCI
2008

85views more TRANSCI 2008»

Probabilistic Traveling Salesman Problem with Deadlines

13 years 11 months ago