Solution attractor of local search system: a method to reduce computational complexity of the traveling salesman problem

DOI10.1137/1.9781611976229.7MaRDI QIDQ6540001zbMATH OpenFDO

Authors Weiqi Li

Publication date 15 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611976229.7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Solution attractor of local search in travelling salesman problem: concept, construction and application
• The Traveling Salesman Problem
• scientific article; zbMATH DE number 2158373
• scientific article; zbMATH DE number 177832
• scientific article; zbMATH DE number 2079898

Cited in

(1)

• The Traveling Salesman Problem

This page was built for publication: Solution attractor of local search system: a method to reduce computational complexity of the traveling salesman problem

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