DocumentCode
3412907
Title
A self-stabilizing distributed branch-and-bound algorithm
Author
Yahfoufi, Nassir ; Dowaji, Salah
Author_Institution
Lab. PRiSM, Univ. de Versailles-St-Quentin, France
fYear
1996
fDate
27-29 Mar 1996
Firstpage
246
Lastpage
252
Abstract
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
Keywords
distributed algorithms; fault tolerant computing; tree searching; combinatorial optimization; self-stabilizing distributed branch-and-bound algorithm; transient faults; transmission errors; Algorithm design and analysis; Computational modeling; Distributed algorithms; Humans; Linear programming; NP-complete problem; Protocols; Samarium; Space exploration; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 1996., Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on
Conference_Location
Scottsdale, AZ
Print_ISBN
0-7803-3255-5
Type
conf
DOI
10.1109/PCCC.1996.493641
Filename
493641
Link To Document