(Enter summary)
Abstract: An exponential neighbourhood for the traveling salesman problem (TSP) is a set of
tours, which grows exponentially in the input size. An exponential neighbourhood is
polynomial time searchable if we can find the best among the exponential number of
tours in polynomial time.
Deineko and Woeginger asked if there exists polynomial time searchable neighbourhoods
of size at least bffnc!, for some ff ?
1
2 , where n is the number of vertices in the
TSP. In this paper we prove that such... (Update)
Context of citations to this paper: More
.... Deineko and Woeginger (1996) Glover (1996) Glover and Punnen (1997) Gutin (1998) Gutin and Yeo (1998) Punnen (1996) and Yeo (1997). The strongest result was obtained in Gutin and Yeo (1998) there is a polynomial algorithm B with dom(B; n) Omega Gamma n =t n )...
...of classes of ATSP instances. COP combines modi cations of two other new algorithms, Recursive Path Contraction (RPC) originating from [2], and Greedy Karp Steele Patching (GKS) 1] The latter is based on the Karp Steele Patching heuristic (KSP) 3, 4] but considers a...
Cited by: More
Polynomial approximation algorithms for the TSP and the QAP.. - Gutin, Yeo
(Correct)
Evaluation of the Contract-or-Patch Heuristic for the.. - Gutin, Zverovich (2000)
(Correct)
Polynomial algorithms for the TSP and the QAP with a factorial.. - Gutin, Yeo (1998)
(Correct)
Active bibliography (related documents): More All
0.4: Semicomplete Multipartite Digraphs - Yeo (1998)
(Correct)
0.3: TSP heuristics with large domination number - Gutin, Yeo (1998)
(Correct)
0.2: Survey of Anders Yeo's papers - In This
(Correct)
Similar documents based on text: More All
0.6: Small Diameter Neighbourhood Graphs for the Traveling Salesman.. - Gutin, Yeo (1999)
(Correct)
0.4: Exponential Neighbourhood Local Search for the Traveling Salesman.. - Gutin
(Correct)
0.2: TSP tour domination and Hamilton cycle decompositions of.. - Gutin, Yeo (1999)
(Correct)
Related documents from co-citation: More All
2: A new heuristic for the traveling salesman problem (context) - Carlier, Villon - 1990
2: The traveling salesman problem and minimum spanning trees: Part II (context) - Held, Karp - 1971
2: The Theory of Graphs (context) - Berge - 1958
BibTeX entry: (Update)
Yeo, A. (1997). Large exponential neighbourhoods for the traveling salesman problem, Preprint no. 47, Department Maths and CS, Odense University. http://citeseer.ist.psu.edu/yeo97large.html More
@techreport{ yeo97large,
author = "Anders Yeo",
title = "Large Exponential Neighbourhoods for the Traveling Salesman Problem",
number = "PP-1997-47",
month = "2,",
year = "1997",
url = "citeseer.ist.psu.edu/yeo97large.html" }
Citations (may not include all citations):
1749
An Introduction to Probability Theory and Its Applications (context) - Feller - 1968
537
Graph Theory with Applications (context) - Bondy, Murty - 1976
193
The traveling salesman problem (context) - Lawler, Lenstra et al. - 1985
30
A dynamic programming approach to sequencing problems (context) - Held, Karp - 1962
18
The traveling salesman problem: New solvable cases and linka.. (context) - Glover, Punnen - 1997
16
The traveling salesman problem: new polynomial approximation.. (context) - Punnen - 1996
16
The traveling Salesman problem: Computational Solutions for .. (context) - Reinelt - 1994
15
Exponential neighbourhoods local search for the traveling sa..
- Gutin
10
An analysis of alternative strategies for implementing match.. (context) - Ball, Derigs - 1983
7
A Study of Exponential Neighborhoods for the Traveling Sales.. (context) - Deineko, Woeginger - 1997
1
Note on Alternating Directed Cycles
- Gutin, Sudakov et al.
Documents on the same site (http://www.imada.ou.dk/Research/Preprints/1997.html): More
Einstein-Weyl Geometry - Calderbank, Pedersen (1998)
(Correct)
Dirac operators and Clifford analysis on manifolds with boundary - Calderbank (1997)
(Correct)
Diregular c-Partite Tournaments Are Vertex-Pancyclic when c ≥ 5 - Yeo (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC