A binomial distribution model for the traveling salesman problem based on frequency quadrilaterals
DOI10.7155/JGAA.00400zbMATH Open1344.05075OpenAlexW2476125296MaRDI QIDQ2819862FDOQ2819862
Authors: Jeffrey Remmel, Yong Wang
Publication date: 13 September 2016
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00400
Recommendations
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
- The frequency of the optimal Hamiltonian cycle 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
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Cited In (8)
- Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals
- A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals
- Special Frequency Quadrilaterals and an Application
- The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals
- 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
- Bounded degree graphs computed for traveling salesman problem based on frequency quadrilaterals
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
Uses Software
This page was built for publication: A binomial distribution model for the traveling salesman problem based on frequency quadrilaterals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819862)