A MODEL OF "NONADDITIVE" ROUTING PROBLEM WHERE THE COSTS DEPEND ON THE SET OF PENDING TASKS
暂无分享,去创建一个
[1] Dalibor Bartoněk. Algorithm for Travelling Salesman Problem , 2015 .
[2] A. G. Chentsov. To question of routing of works complexes , 2013 .
[3] 室 章治郎. Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .
[4] А А Ченцов,et al. Экстремальная задача маршрутизации перемещений с ограничениями и внутренними потерями , 2010 .
[5] F. Stephan,et al. Set theory , 2018, Mathematical Statistics with Applications in R.
[6] Stefan Näher,et al. The Travelling Salesman Problem , 2011, Algorithms Unplugged.
[7] Валерий Леонидович Макаров. Экономика и математические методы , 2015 .
[8] Richard Bellman,et al. Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] М Гэри,et al. Вычислительные машины и труднорешаемые задачи , 1982 .
[11] A. Friedman. Foundations of modern analysis , 1970 .
[12] Klaudia Frankfurter. Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .
[13] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[14] A. G. Chentsov,et al. About one route problem with interior works , 2012 .