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

DOI10.1134/S0005117906070034zbMath1194.90076OpenAlexW4246556625MaRDI QIDQ885705

S. I. 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

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

Cites Work

• Unnamed Item
• The traveling salesman problem. I: Theoretical issues
• A classification of formulations for the (time-dependent) traveling salesman problem
• The traveling salesman problem and its variations
• 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
• A restricted Lagrangean approach to the traveling salesman problem

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