The dynamic programming method in the generalized traveling salesman problem

Mathematical and Computer Modelling

Volumn 25, Issue 1, 1997, Pages 93-105

  Chentsov, A G ^a   Korotayeva, L N ^a  

^a INSTITUTE OF MATHEMATICS AND MECHANICS   (Russian Federation)

Author keywords

Bottle neck problem; Diversion of sets system; Dynamic programming; Route optimization; Traveling salesman problem

Indexed keywords

FUNCTIONS; PROBLEM SOLVING; SET THEORY; TRAVELING SALESMAN PROBLEM;

ADDITIVE FUNCTIONS; BOTTLE NECK PROBLEM; DISCRETE CONTINUOUS PROBLEM;

DYNAMIC PROGRAMMING;

EID: 0031040665     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(96)00187-2     Document Type: Article

References (8)

1. 1. R. Bellman, Dynamic programming treatment of the travelling salesman problem, J. Assoc. Comput. Mach. 9 (1), 61-63, (1962).
2. 2. M. Held and R.M. Karp, A dynamic programming approach to sequencing problems, J. Soc. Industr. and Appl. Math. 10 (1), 196-210, (1962).
3. 3. M. Minoux, Programming Mathematique, Theorie et algorithm, Paris, (1989).
4. 4. A.G. Chentsov, L.N. Korotayeva and A.N. Sesekin, On a modification of the method of dynamic programming in a successive approach problem, Zh. Vychisl. Mat. Fiz. 29 (8), 1107-1113, (1989).
5. 5. L.T. Buslayeva and A.G .Chentsov, On the problem of the decomposition of the process of successive choice of variants, Mat. Modelirovanie 3 (4), 103-113, (1991).
6. 6. A.G. Chentsov, L.N. Korotayeva and E.M. Nazarov, An assignment problem, Comput. Maths Math. Phys. 33 (4), 443-452, (1993).
7. 7. A.G. Chentsov and L.N. Korotayeva, A generalization of the traveling salesman problem at "bottlenecks", Comput. Maths Math. Phys. 35 (7), 853-859, (1995).
8. 8. R. Bellman and R. Kalaba, Dynamic Programming and Modern Control Theory, Acad. Press, New York, (1965).