The dynamic programming method in the generalized traveling salesman problem
作者： A.G. Chentsov , L.N. Korotayeva
DOI: 10.1016/S0895-7177(96)00187-2
关键词:
摘要: A procedure of the dynamic programming (DP) for discrete-continuous problem a route optimization is considered. It possible to consider this as method towns choice in well-known traveling salesman problem. In considered version DP, elements are used. Two variants function aggregations losses investigated: 1.(1) additive functions; 2.(2) characterizing aggregation bottle-neck
acm.org
elsevier.com
sci-hub.se 参考文章(5)
Richard Ernest Bellman, Robert E. Kalaba, Dynamic Programming and Modern Control Theory ,(1966)
Michael Held, Richard M. Karp, A Dynamic Programming Approach to Sequencing Problems Journal of The Society for Industrial and Applied Mathematics. ,vol. 10, pp. 196- 210 ,(1962) , 10.1137/0110015
Richard Bellman, Dynamic Programming Treatment of the Travelling Salesman Problem Journal of the ACM. ,vol. 9, pp. 61- 63 ,(1962) , 10.1145/321105.321111
L. N. Korotayeva, E. M. Nazarov, A. G. Chentsov, An assignment problem Computational Mathematics and Mathematical Physics. ,vol. 33, pp. 443- 452 ,(1993)
L. N. Korotayeva, A. G. Chentsov, A generalization of the travelling-salesman problem at “bottlenecks” Computational Mathematics and Mathematical Physics. ,vol. 35, pp. 853- 859 ,(1995)