On the robustness of potential-based flow networks

Abstract

Potential-based flows provide a simple yet realistic mathematical model of transport in many real-world infrastructure networks such as, e.g., gas or water networks, where the flow along each edge depends on the difference of the potentials at its end nodes. We call a network topology robust if the maximal node potential needed to satisfy a set of demands never increases when demands are decreased. This notion of robustness is motivated by infrastructure networks where users first make reservations for certain demands that may be larger than the actual flows sent later on. In these networks, node potentials correspond to physical quantities such as pressures or hydraulic heads and must be guaranteed to lie within a fixed range, even if the actual amounts are smaller than the previously reserved demands. Our main results are a precise characterization of robust network topologies for the case of point-to-point demands via forbidden node-labeled graph minors, as well as an efficient algorithm for testing robustness.

Design and Analysis of Hospital Throughput Maximization Algorithm under COVID-19 Pandemic

“…Network flow is a kind of specific flow solving method, which is closely related to linear programming. The theory and application of network flow are developing continuously, and new topics such as flow with gain, multiterminal flow, multicommodity flow, and the decomposition and synthesis of network flow appear [ 45 ]. Network flow has been widely used in communication, transportation, power, engineering planning, task assignment, equipment updating, and computer-aided design.…”

Packing Under Convex Quadratic Constraints

“…The instance contains upper and lower pressure bounds for every node v ∈ V as well as all physical properties to compute the pipe resistances β e , e ∈ E. Sources and sinks are denoted by S and T , respectively. Every sink t ∈ T requests a transportation of q t units of gas to t. To ensure the robustness of the network in the sense of [15], we assume that all sinks between s 1 and s 2 are (possibly) supplied by s 1 , all sinks between s 3 and t 45 by s 3 , and all other sinks by s 2 . Denote the set of all sinks that are (possibly) supplied by s i by T i , i = 1, 2, 3.…”