Approximate algorithms for the traveling salesman problem. II

DOI10.1134/S0005117915030108zbMATH Open1327.90398MaRDI QIDQ499569FDOQ499569

Authors: S. Sergeev 

Publication date: 30 September 2015

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

Recommendations

• scientific article; zbMATH DE number 4095236
• The traveling salesman problem. Approximate algorithms
• scientific article; zbMATH DE number 1534500
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• scientific article; zbMATH DE number 808804

Mathematics Subject Classification ID

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

Cites Work

• The traveling salesman problem and its variations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computer algorithms for the solution of some linear and linear integer programming problems. I-IV
• A restricted Lagrangean approach to the traveling salesman problem
• Nonlinear resolving functions for the travelling salesman problem
• Successive approximations of Bellman's function
• Reduced complexity dynamic programming based on policy iteration
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximum travelling salesman problem. I

Cited In (17)

• The traveling salesman problem. Approximate algorithms
• A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• A diagonal completion and 2-optimal procedure for the travelling salesman problem
• Title not available (Why is that?)
• Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
• Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
• Title not available (Why is that?)
• A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem
• Title not available (Why is that?)
• The physicist's approach to the travelling salesman problem. II
• Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem
• On the approximability of the traveling salesman problem
• Two truck travelling salesman simulation
• Maximum travelling salesman problem. I

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499569)