Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals

DOI10.1007/s10957-018-01465-9OpenAlexW2910997003WikidataQ128622778 ScholiaQ128622778MaRDI QIDQ2420806

Yong Wang

Publication date: 7 June 2019

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-018-01465-9

zbMATH Keywords

traveling salesman problemsufficient conditionnecessary conditionfrequency quadrilateraloptimal Hamiltonian cycle

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals ⋮ The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem ⋮ The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem

Cites Work

• A comparison of lower bounds for the symmetric circulant traveling salesman problem
• Certification of an optimal TSP tour through 85,900 cities
• An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
• The traveling salesman problem and its variations.
• A Binomial Distribution Model for the Traveling Salesman Problem Based on Frequency Quadrilaterals
• Edge Elimination in TSP Instances
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Improved Inapproximability for TSP
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• On the Computational Complexity of Combinatorial Problems

This page was built for publication: Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals