Related papers: Potent and Max-Flow Algorithms
Real world networks are often subject to severe uncertainties which need to be addressed by any reliable prescriptive model. In the context of the maximum flow problem subject to arc failure, robust models have gained particular attention.…
This paper introduces a differentiable representation for the optimization of boustrophedon path plans in convex polygons, explores an additional parameter of these path plans that can be optimized, discusses the properties of this…
Effective motion planning in high dimensional spaces is a long-standing open problem in robotics. One class of traditional motion planning algorithms corresponds to potential-based motion planning. An advantage of potential based motion…
We discuss what is an optimal velocity field for more heat transfer and less energy dissipation under the constraints of the continuity equation for the velocity and the advection-diffusion equation for temperature in plane Couette flow.…
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…
In order to prevent conflicting or counteracting use of flexibility options, the coordination between distribution system operator and transmission system operator has to be strengthened. For this purpose, methods for the standardized…
In stars and planets, magnetic fields are believed to originate from the motion of electrically conducting fluids in their interior, through a process known as the dynamo mechanism. In this Letter, an optimization procedure is used to…
Given an irrotational (vorticity free) velocity field in real space, we prove that, in the distant observer limit and in the absence of multi-valued zones, the associated velocity field in redshift space is also irrotational. The proof does…
This paper provides a systematic investigation into the various nonlinear objective functions which can be used to explore the feasible space associated with the optimal power flow problem. A total of 40 nonlinear objective functions are…
The transverse velocities of steadily rotating, non--axisymmetric patterns in flat galaxies may be determined by a purely kinematical method, using two dimensional maps of a tracer surface brightness and radial current density. The…
We propose a protocol optimization technique that is applicable to both weighted or unweighted graphs. Our aim is to explore by how much a small variation around the Shortest Path or Optimal Path protocols can enhance protocol performance.…
In this paper, we propose a new way to obtain optimal convergence rates for smooth stochastic (strong) convex optimization tasks. Our approach is based on results for optimization tasks where gradients have nonrandom noise. In contrast to…
Modeling traffic distribution and extracting optimal flows in multilayer networks is of utmost importance to design efficient multi-modal network infrastructures. Recent results based on optimal transport theory provide powerful and…
The classical optimal power flow problem optimizes the power flow in a power network considering the associated flow and operating constraints. In this paper, we investigate optimal power flow in the context of utility-maximizing demand…
The displacement field in highly non uniformly strained crystals is obtained by addition of constraints to an iterative phase retrieval algorithm. These constraints include direct space density uniformity and also constraints to the sign…
In this paper, we study flows associated to Sobolev vector fields with subexponentially integrable divergence. Our approach is based on the transport equation following DiPerna-Lions [DPL89]. A key ingredient is to use a quantitative…
By building upon the recent theory that established the connection between implicit generative modeling (IGM) and optimal transport, in this study, we propose a novel parameter-free algorithm for learning the underlying distributions of…
We present a method to extract temporal hypergraphs from sequences of 2-dimensional functions obtained as solutions to Optimal Transport problems. We investigate optimality principles exhibited by these solutions from the point of view of…
The maximum function, on vectors of real numbers, is not differentiable. Consequently, several differentiable approximations of this function are popular substitutes. We survey three smooth functions which approximate the maximum function…
Observations of the line-of-sight component of emitter velocities in galaxies are valuable for reconstructing their 2D velocity fields, albeit requiring certain assumptions. A common one is that radial flows can be neglected in the outer…