A method to compute the sparse graphs for traveling salesman problem based on frequency quadrilaterals

DOI10.1007/978-3-319-78455-7_22zbMath1452.90280arXiv1801.09407OpenAlexW2963642474MaRDI QIDQ777307

Yong Wang, Jeffery B. Remmel

Publication date: 7 July 2020

Full work available at URL: https://arxiv.org/abs/1801.09407

zbMATH Keywords

iterative algorithmtraveling salesman problemprobability modelsparse graphfrequency quadrilateral

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Related Items

Special Frequency Quadrilaterals and an Application, The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem, Learning to sparsify travelling salesman problem instances

Uses Software

• TSPLIB