Skip to main content
Conference ProceedingsOPEN ACCESS

Fast branch and bound algorithm for the travelling salesman problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9842 LNCS 206-217
DOI: 10.1007/978-3-319-45378-1_19
2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Grymin, R., & Jagiełło, S. (2016). Fast branch and bound algorithm for the travelling salesman problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9842 LNCS, pp. 206–217). Springer Verlag. https://doi.org/10.1007/978-3-319-45378-1_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free