Learning to sparsify travelling salesman problem instances
type: Item
instance of: scholarly article
title: Learning to sparsify travelling salesman problem instances
DOI: 10.1007/978-3-030-78230-6_26
author: James Fitzpatrick
author: Deepak Ajwani
author: Paula Carroll
publication date: 2022-03-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/2104.09345
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7493643
zbMATH Keywords: travelling salesman problem
zbMATH Keywords: graph sparsification
zbMATH Keywords: machine learning
zbMATH Keywords: linear programming
zbMATH Keywords: integer programming
describes a project that uses: TSPLIB
describes a project that uses: NetworkX
describes a project that uses: LKH
describes a project that uses: Scikit
describes a project that uses: SCIP
describes a project that uses: PySCIPOpt
MaRDI profile type: Publication
OpenAlex ID: W3174346336
cites work: Certification of an optimal TSP tour through 85,900 cities
cites work: Mixed integer programming: A historical perspective with Xpress-MP
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Exploiting Erraticism in Search
cites work: A General Framework for Graph Sparsification
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Edge Elimination in TSP Instances
cites work: PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite
cites work: Q5396710
cites work: Graph spanners
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Q3931037
cites work: Generalization of machine learning for problem reduction: a case study on travelling salesman problems
cites work: A method to compute the sparse graphs for traveling salesman problem based on frequency quadrilaterals
description: scientific article; zbMATH DE number 7493643