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

Application of element decomposing method for solving traveling salesman problems

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

zbMATH Open1482.90185MaRDI QIDQ3385380FDOQ3385380


Authors: Ekkaphon Jaiyen, Komgrit Leksakul Edit this on Wikidata


Publication date: 18 December 2021


Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/3664




Recommendations

  • A new approach to solve the traveling salesman problem
  • scientific article; zbMATH DE number 56359
  • scientific article; zbMATH DE number 947471
  • Method of scaling in approximate solution of the traveling salesman problem
  • Algorithms for solving the two-criterion large-scale travelling salesman problem


zbMATH Keywords

traveling salesman problemelement decomposing method (EDCM)


Mathematics Subject Classification ID

Combinatorial optimization (90C27)


Cites Work

  • A stochastic dynamic traveling salesman problem with hard time windows
  • Finite element analysis of incompressible viscous flows by the penalty function formulation
  • A dynamic traveling salesman problem with stochastic arc costs






This page was built for publication: Application of element decomposing method for solving traveling salesman problems

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

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