The Pyramidal Method for Traveling Salesman Problem

Simple item page
dc.creatorStefan Pesko
dc.date2000-12-31
dc.date.accessioned2022-06-16T14:03:39Z
dc.date.available2022-06-16T14:03:39Z
dc.descriptionA 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.formattext/html
dc.formatapplication/pdf
dc.identifier13354205
dc.identifier25857878
dc.identifier10.26552/com.C.2000.4.29-34
dc.identifierhttps://komunikacie.uniza.sk/artkey/csl-200004-0004_the-pyramidal-method-for-traveling-salesman-problem.php
dc.identifier.urihttp://drepo.uniza.sk/xmlui/handle/hdluniza/662
dc.languageen
dc.publisherCommunications - Scientific Letters of the University of Zilina
dc.relationhttps://komunikacie.uniza.sk/magno/csl/2000/mn4.php
dc.subjectno keywords
dc.titleThe Pyramidal Method for Traveling Salesman Problem
dc.typejournal article

Files

Collections

Komunikácie