Discrete optimization by optimal control methods. II: The static traveling salesman problem
From MaRDI portal
Publication:2457582
Recommendations
- Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
- Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
- Discrete optimization by optimal control methods. I: Separable problems
- A modification of the dynamic programming method for the travelling-salesman problem
- The traveling salesman problem. II: Exact methods
Cites work
- A restricted Lagrangean approach to the traveling salesman problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Approximation to the solution of the traveling-salesman problem by C- cycles
- Computer Solutions of the Traveling Salesman Problem
- Discrete Optimizing
- scientific article; zbMATH DE number 635066 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- Reduced complexity dynamic programming based on policy iteration
- State-space relaxation procedures for the computation of bounds to routing problems
- The traveling salesman problem and its variations
- The traveling salesman problem. I: Theoretical issues
Cited in
(4)- Hybrid control systems and the dynamic traveling salesman problem
- Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
- A modification of the dynamic programming method for the travelling-salesman problem
- Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
This page was built for publication: Discrete optimization by optimal control methods. II: The static traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457582)