The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
From MaRDI portal
Publication:2090221
DOI10.1007/978-981-16-7443-3_11OpenAlexW3212015437MaRDI QIDQ2090221
Publication date: 24 October 2022
Full work available at URL: https://doi.org/10.1007/978-981-16-7443-3_11
Cites Work
- Unnamed Item
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs
- A comparison of lower bounds for the symmetric circulant traveling salesman problem
- A method to compute the sparse graphs for traveling salesman problem based on frequency quadrilaterals
- Certification of an optimal TSP tour through 85,900 cities
- Constant factor approximation for ATSP with two edge weights
- POPMUSIC for the travelling salesman problem
- A new upper bound for the traveling salesman problem in cubic graphs
- The traveling salesman problem and its variations.
- Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals
- The traveling salesman problem on cubic and subcubic graphs
- 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
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- On the Computational Complexity of Combinatorial Problems
- Exact solution of large-scale, asymmetric traveling salesman problems
- A constant-factor approximation algorithm for the asymmetric traveling salesman problem
- TSP Tours in Cubic Graphs: Beyond 4/3
- The Traveling Salesman Problem for Cubic Graphs
- Fast hierarchical clustering and other applications of dynamic closest pairs
This page was built for publication: The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
