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.

[1]  Teodor Gabriel Crainic,et al.  PARALLEL BRANCH-AND-BOUND ALGORITHMS: SURVEY AND SYNTHESIS , 1993 .

[2]  Farokh B. Bastani,et al.  A Class of Inherently Fault Tolerant Distributed Programs , 1988, IEEE Trans. Software Eng..

[3]  Sartaj Sahni,et al.  Anomalies in Parallel Branch-and-Bound Algorithms , 1984 .

[4]  Reinhard Lüling,et al.  Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network , 1995, Proceedings of 9th International Parallel Processing Symposium.

[5]  Marco Schneider,et al.  Self-stabilization , 1993, CSUR.

[6]  A. Gupta,et al.  A self-stabilizing algorithm for the maximum flow problem , 1995, Proceedings International Phoenix Conference on Computers and Communications.

[7]  Catherine Roucairol.  Parallel computing in combinatorial optimization , 1989 .

[8]  Arobinda Gupta,et al.  A self-stabilizing algorithm for the maximum flow problem , 1997, Distributed Computing.

[9]  Sajal K. Das,et al.  A self-stabilizing shortest path algorithm in a DAG , 1995, Proceedings International Phoenix Conference on Computers and Communications.

[10]  Anish Arora,et al.  Closure and Convergence: A Foundation of Fault-Tolerant Computing , 1993, IEEE Trans. Software Eng..

[11]  Mohamed G. Gouda,et al.  Stabilizing Communication Protocols , 1991, IEEE Trans. Computers.