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

DOI10.1007/978-3-030-57602-8_46MaRDI QIDQ2039712zbMATH OpenOpenAlexFDO

Authors 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

frequency consistencyfrequency of optimal Hamiltonian cyclefrequency quadrilateraltraveling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• A binomial distribution model for the traveling salesman problem based on frequency quadrilaterals
• The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
• Special frequency quadrilaterals and an application
• A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals
• A method to compute the sparse graphs for traveling salesman problem based on frequency quadrilaterals

Cites work

• 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
• A Dynamic Programming Approach to Sequencing Problems
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Certification of an optimal TSP tour through 85,900 cities
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Edge elimination in TSP instances
• Finding the right cutting planes for the TSP
• Nonoptimal Edges for the Symmetric Traveling Salesman Problem
• On the Computational Complexity of Combinatorial Problems
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• POPMUSIC for the travelling salesman problem
• Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals
• The traveling salesman problem and its variations.

Cited in

(9)

• The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
• Bounded degree graphs computed for traveling salesman problem based on frequency quadrilaterals
• 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
• Special frequency quadrilaterals and an application
• A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals
• Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals
• The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals
• A method to compute the sparse graphs for traveling salesman problem based on frequency quadrilaterals

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

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