Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals

DOI10.1016/J.TCS.2023.114323MaRDI QIDQ6138827zbMATH OpenFDO

Authors

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

• A Dynamic Programming Approach to Sequencing Problems
• A binomial distribution model for the traveling salesman problem based on frequency quadrilaterals
• A comparison of lower bounds for the symmetric circulant traveling salesman problem
• Certification of an optimal TSP tour through 85,900 cities
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Edge elimination in TSP instances
• Nonoptimal Edges for the Symmetric Traveling Salesman Problem
• On the Computational Complexity of Combinatorial Problems
• POPMUSIC for the travelling salesman problem
• Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals
• TSP tours in cubic graphs: beyond 4/3
• The asymmetric traveling salesman problem on graphs with bounded genus
• The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem
• The traveling salesman problem and its variations.
• The traveling salesman problem in bounded degree graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138827)