Search academic texts

Information × Registration Number 0213U001396, 0111U001777 , R & D reports Title Development of methods for combinatorial optimization problems in the construction of closed routes on graphs and networks popup.stage_title Head Panishev Anatoly Vasilyevich, Доктор технічних наук Registration Date 01-02-2013 Organization Zhуtomуr State Technological University popup.description2 A new universal exact branch and bound method was developed, which is an improved modification of the classical method of Little. First time proposed the way which is faster than in the algorithm of Little, of lower bounds' calculations for the cost functionals. The developed method is characterized by the speed that surpasses all known exact algorithms closed routes. It allows to solve General, the Hamiltonian and Symmetric Traveling Salesman Problem, the Hamiltononian and Cyclic Rural Postman Problem. Product Description popup.authors Квітка К.В. Левченко А.Ю. Локтікова Т.М. Морозов А.В. Панішев А.В. Панаріна І.В. Пилькевич Т.І. Поволоцька Н.І. Скачкова С.Н. popup.nrat_date 2020-04-02 Close