Related papers: Solving the Convex Flow Problem
The Maximum Flow Problem with Conflict Constraints is a generalization that adds conflict constraints to a classical optimization problem on networks used to model several real-world applications. In the last few years several approaches,…
In this article we consider a certain sub class of Integer Equal Flow problem, which are known NP hard [8]. Currently there exist no direct solutions for the same. It is a common problem in various inventory management systems. Here we…
We consider a nonlinear extension of the generalized network flow model, with the flow leaving an arc being an increasing concave function of the flow entering it, as proposed by Truemper and Shigeno. We give a polynomial time combinatorial…
Integrated electricity and gas systems are constructed to facilitate the gas-fired generation, and the distributed operation of these integrated systems have received much attention due to the increased emphasis on data security and privacy…
Optimal Power Flow (OPF) is an important tool used to coordinate assets in electric power systems to ensure customer voltages are within pre-defined tolerances and to improve distribution system operations. While convex relaxations of…
We propose a branch flow model for the anal- ysis and optimization of mesh as well as radial networks. The model leads to a new approach to solving optimal power flow (OPF) that consists of two relaxation steps. The first step eliminates…
Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In…
Convexification techniques have gained increasing interest over the past decades. In this work, we apply a recently developed convexification technique for fractional programs by He, Liu and Tawarmalani (2024) to the problem of determining…
The DC optimal power flow (DCOPF) problem is a fundamental problem in power systems operations and planning. With high penetration of uncertain renewable resources in power systems, DCOPF needs to be solved repeatedly for a large amount of…
With the proliferation of distributed generation into distribution networks, the need to consider fault currents in the dispatch problem becomes increasingly relevant. This paper introduces a method for adding fault current constraints into…
Power flow refers to the injection of power on the lines of an electrical grid, so that all the injections at the nodes form a consistent flow within the network. Optimality, in this setting, is usually intended as the minimization of the…
This paper proves that non-convex quadratically constrained quadratic programs can be solved in polynomial time when their underlying graph is acyclic, provided the constraints satisfy a certain technical condition. When this condition is…
We propose an algorithm using method of evolving junctions to solve the optimal path planning problems with piece-wise constant flow fields. In such flow fields with a convex Lagrangian in the objective function, we can prove that the…
We present sufficient conditions for the load-flow solvability under security constraints in DC distribution networks. In addition, we show that a load-flow solution that fulfills security constraints can be obtained via a convex…
The convex restriction of the power flow feasible sets identifies the convex subset of power injections where the solution for power flow is guaranteed to exist and satisfy the operational constraints. In contrast to convex relaxations, the…
Flows over time generalize classical network flows by introducing a notion of time. Each arc is equipped with a transit time that specifies how long flow takes to traverse it, while flow rates may vary over time within the given edge…
This paper develops a highly general convex duality framework for the perturbed utility route choice (PURC) model. We show that the traveler's constrained, potentially non-smooth utility maximization problem admits a dual formulation: an…
Where a 2D problem of optimal profile in variable speed flow is resolved in a class of convex Bezier curves, using symbolic and numerical computations.
Given a flow network with variable suppliers and fixed consumers, the minimax flow problem consists in minimizing the maximum flow between nodes, subject to flow conservation and capacity constraints. We solve this problem over acyclic…
Energy minimization has been an intensely studied core problem in computer vision. With growing image sizes (2D and 3D), it is now highly desirable to run energy minimization algorithms in parallel. But many existing algorithms, in…