Exact computation of strongly connected reliability by binary decision diagrams

DOI10.1007/978-3-030-04651-4_19OpenAlexW2901696283MaRDI QIDQ2327117

Hirofumi Suzuki, Masakazu Ishihata, Shin-ichi Minato

Publication date: 11 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-04651-4_19

zbMATH Keywords

dynamic programmingnetwork reliabilitybinary decision diagramall-terminal reliabilitystrongly connected reliability

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances

This page was built for publication: Exact computation of strongly connected reliability by binary decision diagrams