The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem

DOI10.1007/978-3-030-57602-8_46zbMath1470.90109OpenAlexW3047934308MaRDI QIDQ2039712

Yong Wang, Zunpu Han

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_46

zbMATH Keywords

traveling salesman problemfrequency quadrilateralfrequency consistencyfrequency of optimal Hamiltonian cycle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals

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 effective implementation of the Lin-Kernighan traveling salesman heuristic
• POPMUSIC for the travelling salesman problem
• The traveling salesman problem and its variations.
• Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals
• 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
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Nonoptimal Edges for the Symmetric Traveling Salesman Problem
• On the Computational Complexity of Combinatorial Problems
• Finding the right cutting planes for the TSP

This page was built for publication: The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem