Results 21  30
of
14,358
The Nline Traveling Salesman Problem
 NETWORKS
, 1991
"... The special case of the Euclidean Traveling Salesman Problem, where the n given points lie on a small number (N) of parallel lines in the plane, is solved by a dynamic programming approach in time n^N, for fixed N, i. e., in polynomial time. This extends a result of Cutler (1980) for 3 lines. Such p ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The special case of the Euclidean Traveling Salesman Problem, where the n given points lie on a small number (N) of parallel lines in the plane, is solved by a dynamic programming approach in time n^N, for fixed N, i. e., in polynomial time. This extends a result of Cutler (1980) for 3 lines
Probabilistic analysis of the Traveling Salesman Problem
, 2000
"... Introduction In this chapter we study the HamiltonJan cycle and Traveling Salesman problem from a probabilistic point of view. Here we try to elucidate the properties of typical rather than worstcase examples. Structurally, one hopes to bring out the surprising properties of typical instances. Alg ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Introduction In this chapter we study the HamiltonJan cycle and Traveling Salesman problem from a probabilistic point of view. Here we try to elucidate the properties of typical rather than worstcase examples. Structurally, one hopes to bring out the surprising properties of typical instances
The Asymmetric Traveling Salesman Problem ATSP and
"... The Asymmetric Traveling Salesman Problem ATSP as well as a the Asymmetric MultiStopover Problem AMSP (also MultiDestination Problem), is intractable (NPhard). However, using the fastest optimal path algorithms combined with the fastest permutation method enables the realtime solution for proble ..."
Abstract
 Add to MetaCart
The Asymmetric Traveling Salesman Problem ATSP as well as a the Asymmetric MultiStopover Problem AMSP (also MultiDestination Problem), is intractable (NPhard). However, using the fastest optimal path algorithms combined with the fastest permutation method enables the realtime solution
The Quadratic Assignment Problem
 TO APPEAR IN THE HANDBOOK OF COMBINATORIAL OPTIMIZATION
"... This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It discusses the most important developments in all aspects of the QAP such as linearizations, QAP polyhedra, algorithms to solve the problem to optimality, heuristics, polynomially solvable special cases, an ..."
Abstract

Cited by 182 (3 self)
 Add to MetaCart
, and asymptotic behavior. Moreover, it also considers problems related to the QAP, e.g. the biquadratic assignment problem, and discusses the relationship between the QAP and other well known combinatorial optimization problems, e.g. the traveling salesman problem, the graph partitioning problem, etc.
Thesis: Offline and Online Variants of the Traveling Salesman Problem
, 2006
"... Research Interests I am interested in algorithms. Within algorithms, my work has spanned online and offline optimization, computational geometry, and algorithmic game theory. While most of my work involves ..."
Abstract
 Add to MetaCart
Research Interests I am interested in algorithms. Within algorithms, my work has spanned online and offline optimization, computational geometry, and algorithmic game theory. While most of my work involves
PingPong and the Traveling Salesman Problem
"... Submit your article to this journal Article views: 4 View related articles View Crossmark data ..."
Abstract
 Add to MetaCart
Submit your article to this journal Article views: 4 View related articles View Crossmark data
Asymmetric Traveling Salesman Problem Near Optimal Realtime Solution
"... We present an θ(S ⋅ EG) deterministic construction heuristic for the Asymmetric Traveling Salesman Problem ATSP on digraphs G. The heuristic relies on the fast determination of an approximate bidirectional Steiner Tree with respect to the stopovers S ⊆ VG. The algorithm is a robust and very fast ..."
Abstract
 Add to MetaCart
We present an θ(S ⋅ EG) deterministic construction heuristic for the Asymmetric Traveling Salesman Problem ATSP on digraphs G. The heuristic relies on the fast determination of an approximate bidirectional Steiner Tree with respect to the stopovers S ⊆ VG. The algorithm is a robust and very
On the complexity of local search for the traveling salesman problem
 SIAM J. Comput
, 1977
"... Abstract. It is shown that, unless P NP, local search algorithms for the traveling salesman problem having polynomial time complexity per iteration will generate solutions arbitrarily far from the optimal. Key words, traveling salesman problem, local search, complexity, NPcomplete ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
Abstract. It is shown that, unless P NP, local search algorithms for the traveling salesman problem having polynomial time complexity per iteration will generate solutions arbitrarily far from the optimal. Key words, traveling salesman problem, local search, complexity, NPcomplete
Online Steiner Trees in the Euclidean Plane
 Discrete and Computational Geometry
, 1993
"... Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, online, a connected graph that connects all of them, trying to minimize the total sum of lengths of its edges. The points appear one at a time, and at each step the online algorithm must construc ..."
Abstract

Cited by 47 (3 self)
 Add to MetaCart
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, online, a connected graph that connects all of them, trying to minimize the total sum of lengths of its edges. The points appear one at a time, and at each step the online algorithm must
Results 21  30
of
14,358