Sciweavers

242 search results - page 7 / 49
» Approximation Algorithms for Multi-Criteria Traveling Salesm...
Sort
View
208
Voted
NETWORKS
2010
15 years 2 months ago
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
Jean-François Cordeau, Manuel Iori, Gilbert...
128
Voted
TOC
2008
95views more  TOC 2008»
15 years 3 months ago
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
Viswanath Nagarajan
130
Voted
APPROX
2010
Springer
193views Algorithms» more  APPROX 2010»
15 years 5 months ago
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
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...
MohammadHossein Bateni, Julia Chuzhoy
150
Voted
ENDM
2010
136views more  ENDM 2010»
15 years 3 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
85
Voted
NETWORKS
1998
15 years 3 months ago
A branch-and-cut algorithm for the undirected selective traveling salesman problem
Michel Gendreau, Gilbert Laporte, Fréd&eacu...