×

Pairs of adjacent Hamiltonian circuits with small intersection. (English) Zbl 0398.90073


MSC:

90C10 Integer programming
05C45 Eulerian and Hamiltonian graphs
05C35 Extremal problems in graph theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Lebensold, The traveling salesman problem and rearrangeability, and a numerical problem (1969)
[2] Lin, Computer solution of the traveling salesman problem, Bell System Tech J. 44 pp 2245– (1965) · Zbl 0136.14705 · doi:10.1002/j.1538-7305.1965.tb04146.x
[3] Murty, On the tours of a traveling salesman, SIAM J. Control 7 pp 122– (1969) · Zbl 0175.17501 · doi:10.1137/0307009
[4] Papadimitriou, On the complexity of the local structure of certain convex polytopes, Math Programming (1978)
[5] Papadimitriou, On the complexity of local search for the traveling salesman problem, SIAM J. Comput 6 (1) pp 76– (1977) · Zbl 0381.68043 · doi:10.1137/0206005
[6] Rao, Adjacency of the traveling salesman tours and 0-1 vertices, SIAM J. Appl. Math. (1977) · Zbl 0346.90065
[7] Savage, Research Report 14 (1973)
[8] Weiner, Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient, Proceedings, 5th ACM STOC (1977) · Zbl 0348.90145
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.