Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals

DOI10.1016/j.tcs.2023.114323MaRDI QIDQ6138827

No author found.

Publication date: 16 January 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

traveling salesman problemsufficient conditionfrequency quadrilateraloptimal Hamiltonian cycle

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• A comparison of lower bounds for the symmetric circulant traveling salesman problem
• Certification of an optimal TSP tour through 85,900 cities
• POPMUSIC for the travelling salesman problem
• The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling 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
• The traveling salesman problem in bounded degree graphs
• 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
• TSP Tours in Cubic Graphs: Beyond 4/3

This page was built for publication: Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals