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.
Type de document :
Communication dans un congrès
Khalid Saeed; Władysław Homenda. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9842, pp.206-217, 2016, Computer Information Systems and Industrial Management. 〈10.1007/978-3-319-45378-1_19〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01637523
Contributeur : Hal Ifip <>
Soumis le : vendredi 17 novembre 2017 - 15:46:22
Dernière modification le : samedi 18 novembre 2017 - 01:16:39
Document(s) archivé(s) le : dimanche 18 février 2018 - 15:33:14

Fichier

 Accès restreint
Fichier visible le : 2019-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Collections

Citation

Radosław Grymin, Szymon Jagiełło. Fast Branch and Bound Algorithm for the Travelling Salesman Problem. Khalid Saeed; Władysław Homenda. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9842, pp.206-217, 2016, Computer Information Systems and Industrial Management. 〈10.1007/978-3-319-45378-1_19〉. 〈hal-01637523〉

Partager

Métriques

Consultations de la notice

72