Related papers: On Variants of Network Flow Stability
In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…
Robust network flows are a concept for dealing with uncertainty and unforeseen failures in the network infrastructure. They and their dual counterpart, network flow interdiction, have received steady attention within the operations research…
We consider open multi-class queueing networks with general arrival processes, general processing time sequences and Bernoulli routing. The network is assumed to be operating under an arbitrary work-conserving scheduling policy that makes…
Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general…
We propose a simple model for the evolution of an inviscid vortex sheet in a potential flow in a channel with parallel walls. This model is obtained by augmenting the Birkhoff-Rott equation with a potential field representing the effect of…
Stability of inviscid shear shallow water flows with free surface is studied in the framework of the Benney equations. This is done by investigating the generalized hyperbolicity of the integrodifferential Benney system of equations. It is…
The robust minimum cost flow problem under consistent flow constraints (RobMCF$\equiv$) is a new extension of the minimum cost flow (MCF) problem. In the RobMCF$\equiv$ problem, we consider demand and supply that are subject to uncertainty.…
We formulate a steady-state network flow problem for non-ideal gas that relates injection rates and nodal pressures in the network to flows in pipes. For this problem, we present and prove a theorem on uniqueness of generalized solution for…
A fluid queuing network constitutes one of the simplest models in which to study flow dynamics over a network. In this model we have a single source-sink pair and each link has a per-time-unit capacity and a transit time. A dynamic…
It is by now well-known that wireless networks with file arrivals and departures are stable if one uses alpha-fair congestion control and back-pressure based scheduling and routing. In this paper, we examine whether ?alpha-fair congestion…
We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a…
The fundamental theory of energy networks in different energy forms is established following an in-depth analysis of the nature of energy for comprehensive energy utilization. The definition of an energy network is given. Combining the…
The ability to design a transport network such that commodities are brought from suppliers to consumers in a steady, optimal, and stable way is of great importance for nowadays distribution systems. In this Letter, by using the circuit laws…
We study deterministic continuous-time lossy dynamical flow networks with constant exogenous demands, fixed routing, and finite flow and buffer capacities. In the considered model, when the total net flow in a cell ---consisting of the…
The inflow problem of full compressible Navier-Stokes equations is considered on the half line $(0,+\infty)$. Firstly, we give the existence (or non-existence) of the boundary layer solution to the inflow problem when the right end state…
We investigate the global in time stability of regular solutions with large velocity vectors to the evolutionary Navier-Stokes equation in ${\bf R}^3$. The class of stable flows contains all two dimensional weak solutions. The only…
A basic model of a dynamical distribution network is considered, modeled as a directed graph with storage variables corresponding to every vertex and flow inputs corresponding to every edge, subject to unknown but constant inflows and…
We propose an energy stable network (EStable-Net) for solving gradient flow equations. The EStable-Net enables decreasing of a discrete energy along the neural network, which is consistent with the property of the gradient flow equation.…
We prove an existence result for the steady state flow of gas mixtures on networks. The basis of the model are the physical principles of the isothermal Euler equation, coupling conditions for the flow and pressure, and the mixing of…
Flows over time are used to model many real-world logistic and routing problems. The networks underlying such problems -- streets, tracks, etc. -- are inherently undirected and directions are only imposed on them to reduce the danger of…