Related papers: Uncapacitated Flow-based Extended Formulations
Quite generally, constraint-based metabolic flux analysis describes the space of viable flux configurations for a metabolic network as a high-dimensional polytope defined by the linear constraints that enforce the balancing of production…
We show that a reformulation of the governing equations for incompressible multi-phase flow in the volume of fluid setting leads to a well defined energy rate. Weak nonlinear inflow-outflow and solid wall boundary conditions complement the…
Lubrication theory makes use of the assumptions of a long and thin fluid domain and a small scaled Reynolds number to formulate a linearized approximation to the Navier-Stokes equations. Extended lubrication theory aims to improve the model…
We study the mixed-integer epigraph of a special class of convex functions with non-convex indicator constraints, which are often used to impose logical constraints on the support of the solutions. The class of functions we consider are…
In this thesis we consider the free surface flow due to a submerged source in a channel of finite depth. This problem has been considered previously in the literature, with some disagreement about whether or not a train of waves exist on…
In recent years, the power system research community has seen an explosion of novel methods for formulating and solving power network optimization problems. These emerging methods range from new power flow approximations, which go beyond…
We present a new strongly polynomial algorithm for generalized flow maximization that is significantly simpler and faster than the previous strongly polynomial algorithm [V\'egh16]. For the uncapacitated problem formulation, the complexity…
The construction of a cost minimal network for flows obeying physical laws is an important problem for the design of electricity, water, hydrogen, and natural gas infrastructures. We formulate this problem as a mixed-integer non-linear…
We adapt the precise definition of the flowing effective action in order to obtain a functional flow equation with simple properties close to physical intuition. The simplified flow equation is invariant under local gauge transformations…
Many generative models originally developed in finite-dimensional Euclidean space have functional generalizations in infinite-dimensional settings. However, the extension of rectified flow to infinite-dimensional spaces remains unexplored.…
We give faster algorithms for weak expander decompositions and approximate max flow on undirected graphs. First, we show that it is possible to "warm start" the cut-matching game when computing weak expander decompositions, avoiding the…
We numerically demonstrate the unidirectional flow of flat-top solitons when interacting with two reflectionless potential wells with slightly different depths. The system is described by a nonlinear Schr\"{o}dinger equation with dual…
A multiflow in a planar graph is uncrossed if its support paths do not cross. Recently such flows have played a role in approximation algorithms for maximum disjoint paths in "fully-planar" instances, where the combined supply-demand graph…
The notion of the flow introduced by Kitaev is a manifestly topological formulation of the winding number on a real lattice. First, we show in this paper that the flow is quite useful for practical numerical computations for systems without…
In this paper, the general formulation for inextensible flows of curves on oriented surface in $\mathbb{R}^3 $ is investigated. The necessary and sufficient conditions for inextensible curve flow lying an oriented surface are expressed as a…
The existing paradox between theory and computational experiment for weak solutions of systems of conservation laws in higher space dimensions is arguably resolved. Apparently successful computations are identified with underlying…
An improved fully polynomial-time approximation scheme and a greedy heuristic for the fractional length-bounded maximum multicommodity flow problem with unit edge-lengths are proposed. Computational experiments are carried out on benchmark…
We introduce an alternative to the method of matched asymptotic expansions. In the "traditional" implementation, approximate solutions, valid in different (but overlapping) regions are matched by using "intermediate" variables. Here we…
In this paper, we generalize the minimum flow decomposition problem (MFD) to incorporate uncertain edge capacities and tackle it from the perspective of robust optimization. In the classical flow decomposition problem, a network flow is…
In 1991, Yannakakis (J. Comput. System Sci., 1991) proved that no symmetric extended formulation for the matching polytope of the complete graph K_n with n nodes has a number of variables and constraints that is bounded subexponentially in…