Related papers: Optimal flow through the disordered lattice
We investigate the energy transfer from the mean profile to velocity fluctuations in channel flow by calculating nonlinear optimal disturbances,i.e. the initial condition of a given finite energy that achieves the highest possible energy…
In this paper, the well-posedness and optimal convergence rates of subsonic irrotational flows through a three dimensional infinitely long nozzle with a smooth obstacle inside are established. More precisely, the global existence and…
We explore here surprising links between the time-cost-tradeoff problem and the minimum cost flow problem that lead to fast, strongly polynomial, algorithms for both problems. One of the main results is a new algorithm for the unit capacity…
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…
We consider a parabolic obstacle problem for Euler's elastic energy of graphs with fixed ends. We show global existence, well-posedness and subconvergence provided that the obstacle and the initial datum are suitably 'small'. For symmetric…
Suppose that under the action of gravity, liquid drains through the unit $d$-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal…
Motivated by optimal re-balancing of a portfolio, we formalize an optimal transport problem in which the transported mass is scaled by a mass-change factor depending on the source and destination. This allows direct modeling of the creation…
In this paper, we consider a chance-constrained formulation of the optimal power flow problem to handle uncertainties resulting from renewable generation and load variability. We propose a tuning method that iterates between solving an…
We consider wall-to-wall transport of a passive tracer by divergence-free velocity vector fields $\mathbf{u}$. Given an enstrophy budget $\langle |\nabla \mathbf{u}|^{2} \rangle \le Pe^{2}$ we construct steady two-dimensional flows that…
We consider a class of optimal control problems for measure-valued nonlinear transport equations describing traffic flow problems on networks. The objective isto minimise/maximise macroscopic quantities, such as traffic volume or average…
We prove results relating the theory of optimal transport and generalized Ricci flow. We define an adapted cost functional for measures using a solution of the associated dilaton flow. This determines a formal notion of geodesics in the…
We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are "orthogonal" to each other, in the sense that the flow saturates the cut and is zero…
In its most general form, the optimal transport problem is an infinite-dimensional optimization problem, yet certain notable instances admit closed-form solutions. We identify the common source of this tractability as \textit{symmetry} and…
In this work we study the degree distribution, the maximum vertex and edge flow in non-uniform random Delaunay triangulations when geodesic routing is used. We also investigate the vertex and edge flow in Erd\"os-Renyi random graphs,…
We give a combinatorial algorithm for computing exact maximum flows in directed graphs with $n$ vertices and edge capacities from $\{1,\dots,U\}$ in $\tilde{O}(n^{2}\log U)$ time, which is near-optimal on dense graphs. This shaves an…
With the tremendous increase of the Internet traffic, achieving the best performance with limited resources is becoming an extremely urgent problem. In order to address this concern, in this paper, we build an optimization problem which…
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 problem of finding flows in undirected graphs so as to minimize the weighted $p$-norm of the flow for any $p > 1$. When $p=2$, the problem is that of finding an electrical flow, and its dual is equivalent to solving a Laplacian…
An optimal control problem for longitudinal motions of a thin elastic rod is considered. We suppose that a normal force, which changes piecewise constantly along the rod's length, is applied to the cross-section so that the positions of…
How should we thread a single string through a set of tubes so that pulling the string taut self-assembles the tubes into a desired graph? While prior work [ITCS 2024] solves this problem with the goal of minimizing the length of string, we…