Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals

DOI10.1016/J.TCS.2023.114323MaRDI QIDQ6138827FDOQ6138827

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

• The traveling salesman problem in bounded degree graphs
• A Dynamic Programming Approach to Sequencing Problems
• TSP tours in cubic graphs: beyond 4/3
• Certification of an optimal TSP tour through 85,900 cities
• Dynamic Programming Treatment of the Travelling Salesman Problem
• On the Computational Complexity of Combinatorial Problems
• The traveling salesman problem and its variations.
• A comparison of lower bounds for the symmetric circulant traveling salesman problem
• Nonoptimal Edges for the Symmetric Traveling Salesman Problem
• The asymmetric traveling salesman problem on graphs with bounded genus
• POPMUSIC for the travelling salesman problem
• The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem
• 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

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)