%0 Conference Proceedings
%T Fast Branch and Bound Algorithm for the Travelling Salesman Problem
%+ Wroclaw University of Science and Technology
%A Grymin, Radosław
%A Jagiełło, Szymon
%Z Part 4: Optimization, Tuning
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
%C Vilnius, Lithuania
%Y Khalid Saeed
%Y Władysław Homenda
%I Springer International Publishing
%3 Computer Information Systems and Industrial Management
%V LNCS-9842
%P 206-217
%8 2016-09-14
%D 2016
%R 10.1007/978-3-319-45378-1_19
%K Branch-and-Bound
%K Dynamic programming
%K Parallel algorithm
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%Z TC 8
%2 https://inria.hal.science/hal-01637523/document
%2 https://inria.hal.science/hal-01637523/file/419526_1_En_19_Chapter.pdf
%L hal-01637523
%U https://inria.hal.science/hal-01637523
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC8
%~ IFIP-CISIM
%~ IFIP-LNCS-9842