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

DOI10.1016/0041-5553(89)90123-7MaRDI QIDQ3196904zbMATH OpenOpenAlexFDO

Authors A. N. Sesekin, A. G. Chentsov, 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

Bellman functiontime-optimal controltravelling-salesman problem

Mathematics Subject Classification ID

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

Recommendations

• Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
• scientific article; zbMATH DE number 519980
• Reduction of route optimization problems
• Discrete optimization by optimal control methods. II: The static traveling salesman problem
• Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming

Cited in

(18)

• The dynamic programming method in the generalized traveling salesman problem
• Reduction of route optimization problems
• The travelling-salesman problem with moving objects
• 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
• Discrete optimization by optimal control methods. II: The static traveling salesman problem
• scientific article; zbMATH DE number 3847201 (Why is no real title available?)
• scientific article; zbMATH DE number 3880463 (Why is no real title available?)
• 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
• A modified version of Tuy's method for solving d.c. programing problem
• scientific article; zbMATH DE number 519980 (Why is no real title available?)
• Improving TSP Tours Using Dynamic Programming over Tree Decompositions
• Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.
• Searching for a sub-optimal solution of the dynamic traveling salesman problem using the Monte Carlo method
• Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196904)