Discrete optimization by optimal control methods. II: The static traveling salesman problem

DOI10.1134/S0005117906060075zbMath1120.90363MaRDI QIDQ2457582

S. I. Sergeev

Publication date: 23 October 2007

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

Mathematics Subject Classification ID

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

Cites Work

• The traveling salesman problem. I: Theoretical issues
• Reduced complexity dynamic programming based on policy iteration
• Approximation to the solution of the traveling-salesman problem by C- cycles
• The traveling salesman problem and its variations
• State-space relaxation procedures for the computation of bounds to routing problems
• A restricted Lagrangean approach to the traveling salesman problem
• Computer Solutions of the Traveling Salesman Problem
• Discrete Optimizing
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item