Okay, here is the translation following your instructions: Block Flow Theory and Its Applications

Author: Ning Xuanxi
Publisher:
Publish Date: 2005-05-01
Features: In 1993, the author first proposed the max-flow problem in random flow networks, which led to the development of traffic network congestion flow models and their related theories. This book presents preliminary research results in this new field. It is divided into two parts, totaling eight chapters. The first part primarily introduces the basic theory of congestion flow, including fundamental concepts, definitions, and their relationships such as network saturated flow, congestion flow, complete section, and congestion section. It studies various algorithms for determining congestion sections and explores algorithms for solving the network max-congestion flow (max-flow) and min-congestion flow (min-flow), with simulation validation using a network random flow model. The second part introduces the application of congestion flow in traffic network congestion prevention design, renovation, and operational control, as well as research on using cycle-free min-weighted supporting flows to construct Hamiltonian paths (or cycles) in general networks. It proposes a self-organizing algorithm for constructing Hamiltonian paths (or cycles) and proves its polynomial properties. In its empirical research, the algorithm's effectiveness is verified through approximately 8,500 network instances and the solution to the Hamiltonian knight's tour problem in a general chessboard. The appendix provides algorithm source code listings for solving network min-flow and several network generators, as well as theoretical calculations and simulation results for some network min-flows. This book is a reference for researchers and graduate students working in graph theory, network flow theory, computational complexity, operations research, combinatorial mathematics, Hamiltonian cycles, and algorithm design.