Related papers: On Approximating the Dynamic and Discrete Network …
In potential flow networks, the equilibrium flow rates are usually not proportional to the demands and flow control elements are required to regulate the flow. The control elements can broadly be classified into two types - discrete and…
We study the following variant of the classic {\em bin packing} problem. Given a set of items of various sizes, partitioned into groups, find a packing of the items in a minimum number of identical (unit-size) bins, such that no two items…
We study a class of dynamical multi-commodity flow networks in transportation networks. These are modeled as dynamical systems describing the evolution of the densities of a number of different commodities across the cells of a…
We study network design problems for nonlinear and nonconvex flow models without controllable elements under load scenario uncertainties, i.e., under uncertain injections and withdrawals. To this end, we apply the concept of adjustable…
Flow networks are fundamental for understanding systems such as animal and plant vasculature or power distribution grids. These networks can encode, transmit, and transform information embodied in the spatial and temporal distribution of…
Traffic flows in a distributed computing network require both transmission and processing, and can be interdicted by removing either communication or computation resources. We study the robustness of a distributed computing network under…
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…
We consider the problem of finding a feasible single-commodity flow in a strongly connected network with fixed supplies and demands, provided that the sum of supplies equals the sum of demands and the minimum arc capacity is at least this…
While operating communication networks adaptively may improve utilization and performance, frequent adjustments also introduce an algorithmic challenge: the re-optimization of traffic engineering solutions is time-consuming and may limit…
We consider the robust version of a multi-commodity network flow problem. The robustness is defined with respect to the deletion, or failure, of edges. While the flow problem itself is a polynomially-sized linear program, its robust version…
In this paper, we study robust transshipment under consistent flow constraints. We consider demand uncertainty represented by a finite set of scenarios and characterize a subset of arcs as so-called fixed arcs. In each scenario, we require…
This paper reviews the overview of the dynamic shortest path routing problem and the various neural networks to solve it. Different shortest path optimization problems can be solved by using various neural networks algorithms. The routing…
Optimal transport (OT) theory provides a principled framework for modeling mass movement in applications such as mobility, logistics, and economics. Classical formulations, however, generally ignore capacity limits that are intrinsic in…
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, but solvable in linear time on this type of graphs. The…
We consider the problem of reconstructing the paths of a set of points over time, where, at each of a finite set of moments in time the current positions of points in space are only accessible through some small number of their X-rays. This…
Increasing concerns on the security and quality of water distribution systems (WDS), call for computational tools with performance guarantees. To this end, this work revisits the physical laws governing water flow and provides a hierarchy…
We consider the numerical approximation of compressible flow in a pipe network. Appropriate coupling conditions are formulated that allow us to derive a variational characterization of solutions and to prove global balance laws for the…
We propose numerical schemes for the approximate solution of problems defined on the edges of a one-dimensional graph. In particular, we consider linear transport and a drift-diffusion equations, and discretize them by extending Finite…
Network Diversion is a graph problem that has been extensively studied in both the network-analysis and operations-research communities as a measure of how robust a network is against adversarial disruption. This problem is especially well…
We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…