128 search results - page 9 / 26 » On Approximating Multi-Criteria TSP |
170
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
126
click to vote
CAAN
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
167
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
134
click to vote
IPL
2007
15 years 4 months ago
2007
We consider an LP relaxation for ATSP. We introduce concepts of high-value and high-flow cycles in LP basic solutions and show that the existence of this kind of cycles would lea...
128
click to vote
TSP
2010
14 years 10 months ago
2010
Abstract--In this paper, we introduce a novel approach for improved nonlinear system identification in the short-time Fourier transform (STFT) domain. We first derive explicit repr...