Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
From MaRDI portal
Publication:885705
DOI10.1134/S0005117906070034zbMATH Open1194.90076OpenAlexW4246556625MaRDI QIDQ885705FDOQ885705
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
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
Combinatorial optimization (90C27) Integer programming (90C10) Applications of optimal control and differential games (49N90)
Cites Work
- A classification of formulations for the (time-dependent) traveling salesman problem
- The traveling salesman problem and its variations
- Title not available (Why is that?)
- The traveling salesman problem. I: Theoretical issues
- On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
- Solving the routing optimization problem using the dynamic programming method
- A restricted Lagrangean approach to the traveling salesman problem
- One generalization of the traveling salesman problem. II
Cited In (6)
- Reduction of route optimization problems
- 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)