Related papers: Maximum Throughput Problem in Dissipative Flow Net…
We introduce a methodology to study the possible matter flows of an ecosystem defined by observational biomass data and realistic biological constraints. The flows belong to a polyhedron in a multi dimensional space making statistical…
The increasing amount of controllable generation and consumption in distribution grids poses a severe challenge in keeping voltage values within admissible ranges. Existing approaches have considered different optimal power flow…
This paper investigates the end-to-end throughput maximization problem for a two-hop multiple-relay network, with relays powered by simultaneous wireless information and power transfer (SWIPT) technique. Nonlinearity of energy harvester at…
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…
The paper proposes a general framework to analyze control problems for conservation law models on a network. Namely we consider a general class of junction distribution controls and inflow controls and we establish the compactness in $L^1$…
We present a unified method, based on convex optimization, for managing the power produced and consumed by a network of devices over time. We start with the simple setting of optimizing power flows in a static network, and then proceed to…
Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using Neural…
We consider a general optimal control problem in the setting of gradient flows. Two approximations of the problem are presented, both relying on the variational reformulation of gradient-flow dynamics via the Weighted-Energy-Dissipation…
The optimal power flow (OPF) problem determines power generation/demand that minimize a certain objective such as generation cost or power loss. It is nonconvex. We prove that, for radial networks, after shrinking its feasible set slightly,…
We consider a new class of max flow network interdiction problems, where the defender is able to introduce new arcs to the network after the attacker has made their interdiction decisions. We prove properties of when this restructuring will…
We consider the delay minimization problem in an energy harvesting communication network with energy cooperation. In this network, nodes harvest energy from nature for use in data transmission, and may transfer a portion of their harvested…
Many problems in power systems involve optimizing a certain objective function subject to power flow equations and engineering constraints. A long-standing challenge in solving them is the nonconvexity of their feasible sets. In this paper,…
Both natural and engineered supply networks exhibit universal structural patterns, such as the formation of loops, yet the principles governing optimal structures remain unclear. These patterns can be interpreted as solutions of…
The increasing penetration of renewables in distribution networks calls for faster and more advanced voltage regulation strategies. A promising approach is to formulate the problem as an optimization problem, where the optimal reactive…
Addressing the uncertainty introduced by increasing renewable integration is crucial for secure power system operation, yet capturing it while preserving the full nonlinear physics of the grid remains a significant challenge. This paper…
Addressing challenges in urban water infrastructure systems including aging infrastructure, supply uncertainty, extreme events, and security threats, depend highly on water distribution networks modeling emphasizing the importance of…
This paper considers the network flow stabilization problem in power systems and adopts an output regulation viewpoint. Building upon the structure of a heterogeneous port-Hamiltonian model, we integrate network aspects and develop a…
When a flow is not allowed to be reoriented the Maximum Residual Flow Problem with $k$-Arc Destruction is known to be $NP$-hard for $k=2$. We show that when a flow is allowed to be adaptive the problem becomes polynomial for every fixed…
We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive…
Target control of directed networks, which aims to control only a target subset instead of the entire set of nodes in large natural and technological networks, is an outstanding challenge faced in various real world applications. We address…