Method of scaling in approximate solution of the traveling salesman problem

DOI10.1134/S0005117911120083MaRDI QIDQ2392635zbMATH OpenFDO

Authors E. E. Ivanko

Publication date 2 August 2013

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

Full work available at URL https://doi.org/10.1134/S0005117911120083

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
• An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane
• scientific article; zbMATH DE number 1534500
• On an algorithm for solving traveling salesman problems of large dimension
• scientific article; zbMATH DE number 56359

Cites work

• 8/7-approximation algorithm for (1,2)-TSP
• A Dynamic Programming Approach to Sequencing Problems
• A heuristic for the pickup and delivery traveling salesman problem
• Estimating the Held-Karp lower bound for the geometric TSP
• scientific article; zbMATH DE number 871931 (Why is no real title available?)
• One generalization of the traveling salesman problem. I
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• The traveling salesman problem and its variations.
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods

Cited in

(3)

• Method to solve the travelling salesman problem using the inverse of diffusion process
• Application of element decomposing method for solving traveling salesman problems
• An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: Method of scaling in approximate solution of the traveling salesman problem

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