Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

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

From MaRDI portal
Publication:6540001
Jump to:navigation, search

DOI10.1137/1.9781611976229.7zbMATH Open1548.90507MaRDI QIDQ6540001FDOQ6540001


Authors: Weiqi Li Edit this on Wikidata


Publication date: 15 May 2024





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


Mathematics Subject Classification ID

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



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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6540001&oldid=40064315"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 16:20. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki