The Pyramidal Method for Traveling Salesman Problem
dc.creator | Stefan Pesko | |
dc.date | 2000-12-31 | |
dc.date.accessioned | 2022-06-16T14:03:39Z | |
dc.date.available | 2022-06-16T14:03:39Z | |
dc.description | A shortest pyramidal tour (SPT) is a well-solved case of TSP when a distance matrix is the Monge matrix. We study heuristic repeating method for SPT with the distance matrix without restriction. A new procedure for computing SPT is based on a shortest path in the network. Good results for solved the Euclidean TSP instances with the stochastic version of the demonstrated method are presented. | |
dc.format | text/html | |
dc.format | application/pdf | |
dc.identifier | 13354205 | |
dc.identifier | 25857878 | |
dc.identifier | 10.26552/com.C.2000.4.29-34 | |
dc.identifier | https://komunikacie.uniza.sk/artkey/csl-200004-0004_the-pyramidal-method-for-traveling-salesman-problem.php | |
dc.identifier.uri | http://drepo.uniza.sk/xmlui/handle/hdluniza/662 | |
dc.language | en | |
dc.publisher | Communications - Scientific Letters of the University of Zilina | |
dc.relation | https://komunikacie.uniza.sk/magno/csl/2000/mn4.php | |
dc.subject | no keywords | |
dc.title | The Pyramidal Method for Traveling Salesman Problem | |
dc.type | journal article |