• DocumentCode
    3357313
  • Title

    A solution of travelling salesman problem by a method of correlative-regression analysis

  • Author

    Shut, Vasil ; Prozherin, Igor

  • Author_Institution
    Brest State Tech. Univ., Byelorussia
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    267
  • Lastpage
    269
  • Abstract
    In this paper, the travelling salesman problem and its solution by a method of correlative regression analysis are considered. The mathematical model of the given method is considered. The method allows the problem to be solved by using a minimum memory size of ~o(n2 +3n) cells and with a small run time ~o(n)
  • Keywords
    computational complexity; correlation methods; statistical analysis; travelling salesman problems; computational complexity; correlative regression analysis; mathematical model; memory cells; minimum memory size; run time; travelling salesman problem; Algorithm design and analysis; Cities and towns; Costs; Data acquisition; Lagrangian functions; Mathematical model; Paper technology; Partitioning algorithms; Runtime; Traveling salesman problems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, International Workshop on, 2001.
  • Conference_Location
    Crimea
  • Print_ISBN
    0-7803-7164-X
  • Type

    conf

  • DOI
    10.1109/IDAACS.2001.942028
  • Filename
    942028
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3357313