Sciweavers

50 search results - page 1 / 10
» Iterative patching and the asymmetric traveling salesman pro...
Sort
View
DISOPT
2006
46views more  DISOPT 2006»
13 years 4 months ago
Iterative patching and the asymmetric traveling salesman problem
Marcel Turkensteen, Diptesh Ghosh, Boris Goldengor...
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
13 years 6 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
NMA
2010
13 years 2 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso
CAAN
2006
Springer
13 years 8 months ago
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
Boris Goldengorin, Gerold Jäger, Paul Molitor
HIS
2008
13 years 6 months ago
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given ...
Bin Hu, Günther R. Raidl