303 search results - page 29 / 61 » Traveling Salesman Problem with Transportation |
175
click to vote
CAAN
2006
Springer
15 years 9 months ago
2006
Springer
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...
180
Voted
FLAIRS
2010
15 years 4 months ago
2010
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
151
click to vote
COLING
2000
15 years 7 months ago
2000
In this paper, we describe a search procedure for statistical machine translation (MT) based on dynmnic programming (DP). Starting from a DP-based solution to the traveling salesm...
163
click to vote
DAM
2006
15 years 6 months ago
2006
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first impr...
161
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper explores a novel setting for compressed sensing (CS) in which the sampling trajectory length is a critical bottleneck and must be minimized subject to constraints on th...