Related papers: Using network-flow techniques to solve an optimiza…
In this work, we propose an algorithm performing short-term predictions of the flux of vehicles on a stretch of road, using past measurements of the flux. This algorithm is based on a physics-aware recurrent neural network. A discretization…
Surface-subsurface flow models for hydrological applications solve a coupled multiphysics problem. This usually consists of some form of the Richards and shallow water equations. A typical setup couples these two nonlinear partial…
This paper investigates circle patterns with obtuse exterior intersection angles on surfaces of finite topological type. We characterise the images of the curvature maps and establish several equivalent conditions regarding long time…
Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to…
Dynamic network flows, sometimes called flows over time, extend the notion of network flows to include a transit time for each edge. While Ford and Fulkerson showed that certain dynamic flow problems can be solved via a reduction to static…
In this manuscript we review new ideas and first results on application of the Graphical Models approach, originated from Statistical Physics, Information Theory, Computer Science and Machine Learning, to optimization problems of network…
In recent years, there have been a surge in applications of neural networks (NNs) in physical sciences. Although various algorithmic advances have been proposed, there are, thus far, limited number of studies that assess the…
We investigate multi-physical topology optimization for microfluidic mixers employing the phase-field model. The optimization problem is formulated using a modified Ginzburg-Landau free energy functional. To eliminate fluid blockage in…
Very recently a new algorithm to the nonnegative single-source shortest path problem on road networks has been discovered. It is very cache-efficient, but only on static road networks. We show how to augment it to the time-dependent…
Accurate simulation of fluid flow in porous media is challenging due to complex pore-space geometries and the computational cost of solving the Navier-Stokes equations. This difficulty is particularly important when repeated simulations are…
Advancements in computational fluid mechanics have largely relied on Newtonian frameworks, particularly through the direct simulation of Navier-Stokes equations. In this work, we propose an alternative computational framework that employs…
Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general…
This paper presents a heuristic algorithm to solve Minimum Convex-Cost Network Flow Problems (MC-CNFP). This solution algorithm is constructed on the concepts of Network Simplex Method (NSM) for minimum cost network flow problem, Convex…
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…
Fluid simulation is an important research topic in computer graphics (CG) and animation in video games. Traditional methods based on Navier-Stokes equations are computationally expensive. In this paper, we treat fluid motion as point cloud…
In this paper we study a system of advection-diffusion equations in a bulk domain coupled to an advection-diffusion equation on an embedded surface. Such systems of coupled partial differential equations arise in, for example, the modeling…
In this article, we address the solution of advection-dominated flow problems by stabilised methods, by means of least-squares computed stabilised coefficients. As main methodological tool, we introduce a data-driven off-line/on-line…
This paper presents an algorithm for reliability-based topology optimization of linear elastic continua under random-field material model. The modelling random field is discretized into a small number of random variables, and then the…
We study nonconvex distributed optimization in multi-agent networks with time-varying (nonsymmetric) connectivity. We introduce the first algorithmic framework for the distributed minimization of the sum of a smooth (possibly nonconvex and…
Designing and optimizing different flows in networks is a relevant problem in many contexts. While a number of methods have been proposed in the physics and optimal transport literature for the one-commodity case, we lack similar results…