Approximate algorithms for the traveling salesman problem. II

DOI10.1134/S0005117915030108zbMath1327.90398MaRDI QIDQ499569

S. I. Sergeev

Publication date: 30 September 2015

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

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Nonlinear resolving functions for the travelling salesman problem
• Maximum travelling salesman problem. I
• Successive approximations of Bellman's function
• Computer algorithms for the solution of some linear and linear integer programming problems. I-IV
• Reduced complexity dynamic programming based on policy iteration
• The traveling salesman problem and its variations
• Algorithms for solution of the travelling salesman problem. II: New lower bound
• Discrete optimization by optimal control methods. I: Separable problems
• Approximate synthesis of optimal control
• A restricted Lagrangean approach to the traveling salesman problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate algorithms for the traveling salesman problem. II