Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem

DOI10.1134/S0005117906070034MaRDI QIDQ885705zbMATH OpenOpenAlexFDO

Authors S. Sergeev

Publication date 14 June 2007

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117906070034

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10) Applications of optimal control and differential games (49N90)

Recommendations

• Discrete optimization by optimal control methods. II: The static traveling salesman problem
• A modification of the dynamic programming method for the travelling-salesman problem
• Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
• Approximate algorithms for the traveling salesman problem. II
• The dynamic programming method in the generalized traveling salesman problem

Cites work

• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• A classification of formulations for the (time-dependent) traveling salesman problem
• A restricted Lagrangean approach to the traveling salesman problem
• On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
• One generalization of the traveling salesman problem. II
• Solving the routing optimization problem using the dynamic programming method
• The traveling salesman problem and its variations
• The traveling salesman problem. I: Theoretical issues

Cited in

(7)

• Reduction of route optimization problems
• Searching for a sub-optimal solution of the dynamic traveling salesman problem using the Monte Carlo method
• Discrete optimization by optimal control methods. I: Separable problems
• Discrete optimization by optimal control methods. II: The static traveling salesman problem
• Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.
• A modification of the dynamic programming method for the travelling-salesman problem
• Hybrid control systems and the dynamic traveling salesman problem

This page was built for publication: Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem

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