相关论文: Using network-flow techniques to solve an optimiza…

A simple geometrical model is presented for the gravity-driven motion of a single particle on a rough inclined surface. Adopting a simple restitution law for the collisions between the particle and the surface, we arrive at a model in which…

The dispersion process in particulate porous media at low saturation levels takes place over the surface elements of constituent particles and, as we have found previously by comparison with experiments, can be accurately described by…

The compactness of routes in distribution plans is a criterion that has not been sufficiently explored in the literature related to logistics distribution but has shown to have a significant impact on the practical implementation of routing…

In this paper we study convex bi-level optimization problems for which the inner level consists of minimization of the sum of smooth and nonsmooth functions. The outer level aims at minimizing a smooth and strongly convex function over the…

A finite-element algorithm for computing free-surface flows driven by arbitrary body forces is presented. The algorithm is primarily designed for the microfluidic parameter range where (i) the Reynolds number is small and (ii) force-driven…

A substantial number of algorithms exists for the simulation of moving particles suspended in fluids. However, finding the best method to address a particular physical problem is often highly non-trivial and depends on the properties of the…

The shortest path problem is among the most fundamental combinatorial optimization problems to answer reachability queries. It is hard to deter-mine which vertices or edges are visited during shortest path traversals. In this paper, we…

This study proposes the topology optimization method for moving rigid bodies subjected to forces from fluid flow, such as sails and turbines, with an unsteady time-dependent formulation. Unlike existing topology optimization frameworks in…

This article presents a detailed introduction to density-based topology optimisation of fluid flow problems. The goal is to allow new students and researchers to quickly get started in the research area and to skip many of the initial…

We introduce a description of a minimal surface in a space with boundary, as the world-hypersurface that the entangling surface traces. It does so by evolving from the boundary to the interior of the bulk under an appropriate geometric…

We introduce a surface finite element method for the numerical solution of Navier-Stokes equations on evolving surfaces with a prescribed deformation of the surface in normal direction. The method is based on approaches for the full surface…

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…

A formulation of the shallow water equations adapted to general complex terrains is proposed. Its derivation starts from the observation that the typical approach of depth integrating the Navier-Stokes equations along the direction of…

We present efficient deep learning techniques for approximating flow and transport equations for both single phase and two-phase flow problems. The proposed methods take advantages of the sparsity structures in the underlying discrete…

Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to engineer each problem algorithmically, with practical problems recurring in many instances. The practical side of theoretical computer…

We consider the problem of finding optimal shapes of fluid domains. The fluid obeys the Navier--Stokes equations. Inside a holdall container we use a phase field approach using diffuse interfaces to describe the domain of free flow. We…

We consider an off-line optimisation problem where $k$ robots must service $n$ requests on a single line. A request $i$ has weight $w_i$ and takes place at time $t_i$ at location $d_i$ on the line. A robot can service a request and collect…

We consider network models where information items flow %are sent from a source to a sink node. We start with a model where routing is constrained by energy available on nodes in finite supply (like in Smartdust) and efficiency is related…

Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…

Shallow flow or thin liquid film models are used for a wide range of physical and engineering problems. Shallow flow models allow capturing the free surface of the fluid with little effort and reducing the three-dimensional problem to a…