A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals

DOI10.2298/FIL1805697WzbMath1499.05599OpenAlexW2911657257WikidataQ128419326 ScholiaQ128419326MaRDI QIDQ5024637

Yong Wang

Publication date: 26 January 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1805697w

zbMATH Keywords

traveling salesman problemsparse graphfrequency quadrilateral

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure
• Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
• The traveling purchaser problem and its variants
• 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
• P-Complete Approximation Problems
• Finding the right cutting planes for the TSP

This page was built for publication: A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals