Branch-and-bound algorithm for Symmetric Travelling Salesman problem

DOI10.1007/978-3-319-94667-2_26OpenAlexW2810419382MaRDI QIDQ1671016

Mikhail Batsyn, Alexey Nikolaev

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)

Related Items (1)

Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem

This page was built for publication: Branch-and-bound algorithm for Symmetric Travelling Salesman problem