Skip to Main content Skip to Navigation
Conference papers

Fast Branch and Bound Algorithm for the Travelling Salesman Problem

Abstract : New strategies are proposed for implementing algorithms based on Branch and Bound scheme. Those include two minimal spanning tree lower bound modifications, a design based on the fact that edges in the optimal tour can never cross in the euclidean TSP and parallelization of Branch and Bound scheme. Proposed approaches are compared with primary algorithms.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-01637523
Contributor : Hal Ifip <>
Submitted on : Friday, November 17, 2017 - 3:46:22 PM
Last modification on : Saturday, November 18, 2017 - 1:16:39 AM
Long-term archiving on: : Sunday, February 18, 2018 - 3:33:14 PM

File

419526_1_En_19_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Radosław Grymin, Szymon Jagiełło. Fast Branch and Bound Algorithm for the Travelling Salesman Problem. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.206-217, ⟨10.1007/978-3-319-45378-1_19⟩. ⟨hal-01637523⟩

Share

Metrics

Record views

296

Files downloads

938