A Polyhedral Study of the Asymmetric Traveling Salesman Problem with Time Windows

Keywords: Multi-objective combinatorial optimization, Multi-objective Traveling Salesman Problem, Meta-heuristics, Pareto Local search, Decomposition algorithm, Data

We prove that the Christofides algorithm gives a | approx- imation ratio for the special case of traveling salesman problem (TSP) in which the maximum weight in the given graph is

Our algorithms can be applied to robust constraints that occur in various applications such as lot-sizing, the traveling salesman problem with time windows, scheduling prob- lems,

We present an extended formulation for the vehicle routing problem with time windows that allows us to apply the classical (static) robust programming approach to the problem..

From an initial information gathering plan, obtained as an offline solution of either the Dubins Traveling Salesman Problem (DTSP) or the Coverage Path Planning (CPP), the

So we want to study the question whether the polygonal reconstruction problem is solved by a traveling salesman path, provided the sample points are sufficiently dense in the

A NEW HEURISTIC FOR THE TRAVELING SALESMAN PROBLEM 251 Though simulated annealing [4] gives good results, it seems that the best heuristic for the symmetrie TSP is the one of Lin

Cellular GPU Models to Euclidean Optimization Problems : Applications from Stereo Matching to Structured Adaptive Meshing and Traveling Salesman Problem.. Computers and