Skip to Main content Skip to Navigation

Parallélisation de la méthode du "Branch and Cut" pour résoudre le problème du voyageur de commerce

Abstract : The Branch and Cut method has been very successful in solving large Symmetric Traveling Salesman instances to optimality. The time needed to solve these instances is very high, therefore one may want to consider the possibility of using parallel machines to perform the computations. In the first part of this thesis, we present different components of Branch and Cut. We give a polyhedra study of the STSP. We then describe our implementation of the Branch and Cut method. In the second part of this document, we start with a presentation of some basic concepts of parallelism and the state of the art of the parallelization of the branch-and-bound algorithm which is a related method. Next we propose several models to parallelize the Branch and Cut. We present the choices we have made when we have implemented our parallel algorithm: control scheme, load balancing strategy... Finally, we give many computational results on a IBM-SP1 machine.
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download
Contributor : Thèses Imag <>
Submitted on : Thursday, February 19, 2004 - 11:42:05 AM
Last modification on : Friday, November 6, 2020 - 4:12:41 AM
Long-term archiving on: : Friday, April 2, 2010 - 8:25:28 PM


  • HAL Id : tel-00004801, version 1



Mohamed Ekbal Bouzgarrou. Parallélisation de la méthode du "Branch and Cut" pour résoudre le problème du voyageur de commerce. Modélisation et simulation. Institut National Polytechnique de Grenoble - INPG, 1998. Français. ⟨tel-00004801⟩



Record views


Files downloads