A Self-Stabilizing Distributed Branch-and-Bound Algorithm


: The Branch-and-Bound algorithm is fundamental for a variety of applications in Combinatorial Optimization. Known distributed algorithms for this problem do not tolerate faults. This paper presents the first distributed self-stabilizing branch-and-Bound algorithm. This algorithm is inherently tolerant to transient faults and can recover from transmission errors between nodes. Key-words: Branch-and-Bound method, parallel and distributed algorithms, selfstabilization, fault-tolerance. (R'esum'e : tsvp) z Email : pnn@prism.uvsq.fr Laboratoire PRiSM Universit e de Versailles - Saint Quentin en Yvelines 78035 Versailles Cedex, FRANCE. T el ephone/Phone : (33 1) 39 25 40 56 -- T el ecopie/Fax : (33 1) 39 25 40 Un Algorithme Branch-and-Bound Distribu'e Auto-Stabilisant R'esum'e : L'algorithme Branch-and-Bound est fondamental pour une vari'et'e d'applications dans le domaine de l'Optimisation Combinatoire. Les algorithmes connus de ce type ne sont pas tol`erants aux pannes. Ce papier pr'..

Similar works

Full text

oaioai:CiteSeerX.psu: time updated on 10/22/2014

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.