Branch-and-bound algorithm for symmetric travelling salesman problem

DOI10.1007/978-3-319-94667-2_26MaRDI QIDQ1671016zbMATH OpenOpenAlexFDO

Authors Alexey Nikolaev, Mikhail Batsyn

Publication date 6 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94667-2_26

zbMATH Keywords

branch-and-bound algorithm1-treeTraveling Salesman problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• An improved branching rule for the symmetric travelling salesman problem
• The symmetric travelling salesman problem. II: New low bounds
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• New lower bounds for the symmetric travelling salesman problem
• A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem

Cited in

(10)

• Tolerance-based branch and bound algorithms for the ATSP
• scientific article; zbMATH DE number 4189104 (Why is no real title available?)
• A branch and bound algorithm for traveling salesman problem
• Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem
• An improved branching rule for the symmetric travelling salesman problem
• A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
• Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem
• Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm
• A branch-and-cut algorithm for the balanced traveling salesman problem
• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm

This page was built for publication: Branch-and-bound algorithm for symmetric travelling salesman problem

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