A modification of the dynamic programming method for the travelling-salesman problem

DOI10.1016/0041-5553(89)90123-7zbMath0712.49028OpenAlexW1998240821MaRDI QIDQ3196904

A. G. Chentsov, A. N. Sesekin, L. N. Korotayeva

Publication date: 1989

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(89)90123-7

zbMATH Keywords

time-optimal controlBellman functiontravelling-salesman problem

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20)

Related Items (8)

The dynamic programming method in the generalized traveling salesman problem ⋮ Choosing the sequence of approach of a nonlinear object to a group of moving points ⋮ Dynamic programming method in extremal constrained routing problems ⋮ An approach to solution of the movements routing problem with several participants ⋮ An extremal constrained routing problem with internal losses ⋮ Problem of optimal choice of a route under conditions of time discounting ⋮ On one construction of the decomposition of an extremal multicriteria problem ⋮ Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.

This page was built for publication: A modification of the dynamic programming method for the travelling-salesman problem