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.