相关论文: Finding a Feasible Flow in a Strongly Connected Ne…

The AC power flow equations describe the steady-state behavior of the power grid. While many algorithms have been developed to compute solutions to the power flow equations, few theoretical results are available characterizing when such…

The maximum capacity path problem is to find a path from a source to a sink which has the maximum capacity among all paths. This paper addresses an extension of this problem which considers loss factors. It is called the generalized maximum…

In this paper, we focus our attention on the large capacities unsplittable flow problem in a game theoretic setting. In this setting, there are selfish agents, which control some of the requests characteristics, and may be dishonest about…

We combine the work of Garg and Konemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1-eps)-approximation schemes for various versions of the multicommodity flow problem. In particular, if eps is moderately…

The steady-state solution of fluid flow in pipeline infrastructure networks driven by junction/node potentials is a crucial ingredient in various decision-support tools for system design and operation. While the nonlinear system is known to…

Logistics networks arise whenever there is a transfer of material substance or objects (such as checked baggage on international flights) as well as energy, information, or finance through links (channels). A general concept of logistics…

We consider in-network computation of an arbitrary function over an arbitrary communication network. A network with capacity constraints on the links is given. Some nodes in the network generate data, e.g., like sensor nodes in a sensor…

We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities in $m^{1+o(1)}$ time. Our algorithm builds the flow through a…

We study the optimal power flow problem with switching (or, equivalently, the line expansion problem) under demand uncertainty. Specifically, we consider the line-use variables at the first stage and the current- or power-flow at the second…

Reliable propagation of information through large networks, e.g., communication networks, social networks or sensor networks is very important in many applications concerning marketing, social networks, and wireless sensor networks.…

This paper studies an open question in the warehouse problem where a merchant trading a commodity tries to find an optimal inventory-trading policy to decide on purchase and sale quantities during a fixed time horizon in order to maximize…

Recent development of techniques that improve the convergence properties of power flow simulation have been demonstrated to facilitate scaling to large system sizes (80k+ buses). However, the problem remains to reliably identify cases that…

We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow problems. Each electrical flow is given by the solution of a…

Certifying power flow solvability is important for reliable power system operations under volatile operating conditions, but solving power flow equations repeatedly can be costly and may encounter convergence issues. In this paper, we…

We consider a generalization of the unsplittable maximum two-commodity flow problem on undirected graphs where each commodity $i\in{1,2}$ can be split into a bounded number $k_i$ of equally-sized chunks that can be routed on different…

We consider an online version of the well-studied network utility maximization problem, where users arrive one by one and an operator makes irrevocable decisions for each user without knowing the details of future arrivals. We propose a…

In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the arcs. If the source and the sink are on the same face, then…

This paper considers a wireless network where multiple flows are delivering status updates about their respective information sources. An end user aims to make accurate real-time estimations about the status of each information source using…

This two-part paper details a theory of solvability for the power flow equations in lossless power networks. In Part I, we derived a new formulation of the lossless power flow equations, which we term the fixed-point power flow. The model…

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…