Learning to sparsify travelling salesman problem instances

DOI10.1007/978-3-030-78230-6_26MaRDI QIDQ2117244zbMATH OpenOpenAlexFDO

Authors James Fitzpatrick, Deepak Ajwani, Paula Carroll

Publication date 21 March 2022

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

zbMATH Keywords

linear programmingmachine learninginteger programmingtravelling salesman problemgraph sparsification

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites work

• scientific article; zbMATH DE number 3746840 (Why is no real title available?)
• A general framework for graph sparsification
• A method to compute the sparse graphs for traveling salesman problem based on frequency quadrilaterals
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Certification of an optimal TSP tour through 85,900 cities
• Edge elimination in TSP instances
• Exploiting erraticism in search
• Generalization of machine learning for problem reduction: a case study on travelling salesman problems
• Graph spanners
• Mixed integer programming: A historical perspective with Xpress-MP
• Scikit-learn: machine learning in Python
• Solution of a Large-Scale Traveling-Salesman Problem
• TSPLIB—A Traveling Salesman Problem Library
• \textsc{PySCIPOpt}: mathematical programming in Python with the SCIP optimization suite
• ``Neural computation of decisions in optimization problems

Cited in

(2)

• Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
• Machine learning constructives and local searches for the travelling salesman problem

Describes a project that uses

Uses Software

• PySCIPOpt
• Scikit
• LKH
• SCIP
• TSPLIB
• NetworkX

This page was built for publication: Learning to sparsify travelling salesman problem instances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117244)