Zobrazeno 1 - 2
of 2
pro vyhledávání: '"S. Kantsedal"'
Publikováno v:
Avtomobilʹnyj Transport (Harʹkov), Vol 36, Pp 154-160 (2015)
The use of methods of branches and boundaries as well as the methods of dynamic programming at solving the problem of «knapsack» is grounded. The main concepts are expounded. The methods and algorithms development for solving the above specified pr
Externí odkaz:
https://doaj.org/article/d90c3febd7184cfb9453fd3635434ad4
Publikováno v:
Avtomobilʹnyj Transport (Harʹkov), Vol 30, Pp 127-133 (2012)
Lytle’s algorithm is described as proposed for an accurate solution of the salesman Problem. Statistical characteristics of solution duration with lytle’s algorithm of some problems and of their modifications are specified. On the basis of the re
Externí odkaz:
https://doaj.org/article/6b087f3696234f4ca0bde4cc67eb6af5