摘要
The Binary-Addition Tree (BAT) algorithm was introduced in 2021 as an innovative and efficient method for reliability evaluation of binary-state networks. Since then, it has been applied to a variety of related problems, enhancing existing solutions in the literature. Over the past four years, several enhanced versions of BAT have been developed, including the quick and parallelized variants. This chapter briefly reviews related works in the Introduction, presents the necessary preliminaries, details the traditional BAT algorithm, and introduces an improved version, called quick BAT. To keep the chapter concise, we focus on these two versions and refer readers to the cited literature for other variants and their applications to related problems. © 2026 Elsevier Inc. All rights reserved.