Special Frequency Quadrilaterals and an Application

DOI10.1007/978-981-15-0105-0_2zbMath1456.90139OpenAlexW2970933004MaRDI QIDQ3305469

Yong Wang

Publication date: 7 August 2020

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-15-0105-0_2

zbMATH Keywords

traveling salesman problemheuristic algorithmspecial frequency quadrilateral

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• LKH

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
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• A new upper bound for the traveling salesman problem in cubic graphs
• 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
• Nonoptimal Edges for the Symmetric Traveling Salesman Problem
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• On the Computational Complexity of Combinatorial Problems
• Tight bounds for christofides' traveling salesman heuristic
• Exact solution of large-scale, asymmetric traveling salesman problems
• TSP Tours in Cubic Graphs: Beyond 4/3
• The Traveling Salesman Problem for Cubic Graphs
• Finding the right cutting planes for the TSP
• Approximating Graphic TSP by Matchings

This page was built for publication: Special Frequency Quadrilaterals and an Application