Repairable flow networks is a new area of research, which analyzes repair and flow disruption caused by failures of components in static flow networks. This book addresses a gap in current network research by developing theory, algorithms, and applications related to repairable flow networks and networks with disturbed flows. The theoretical results presented lay the foundations of a new generation of ultra-fast algorithms for optimizing the flow in networks after failures or congestion, and the high computational speed creates the powerful possibility of optimal control of very large and complex networks in real time. Furthermore, the possibility for re-optimizing the network flows in real time increases significantly the yield from real production networks and reduces to a minimum the flow disruption caused by failures. The potential application of repairable flow networks reaches across many large and complex systems, including active power networks, telecommunication networks, oil and gas production networks, transportation networks, water supply networks, emergency evacuation networks, and supply networks. The book reveals a fundamental flaw in classical algorithms for maximizing the throughput flow in networks, published since the creation of the theory of flow networks in 1956. Despite the years of intensive research, the classical algorithms for maximizing the throughput flow leave highly undesirable directed loops of flow in the optimized networks. These flow loops are associated with wastage of energy and resources and increased levels of congestion in the optimized networks.