Related papers: Stochastic homogenisation of nonlinear minimum-cos…
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…
The minimum cost-flow problems have been attracted recently in optimization because of their applications in several areas of applied science and real life. Therefore, finding optima solution of these problems would be significant. Although…
We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities in $m^{1+o(1)}$ time. Our algorithm builds the flow through a…
We give a deterministic algorithm for finding the minimum (weight) cut of an undirected graph on $n$ vertices and $m$ edges using $\text{polylog}(n)$ calls to any maximum flow subroutine. Using the current best deterministic maximum flow…
We prove a homogenization theorem for a class of quadratic convolution energies with random coefficients. Under suitably stated hypotheses of ergodicity and stationarity we prove that the $\Gamma$-limit of such energy is almost surely a…
This paper deals with robust optimization applied to network flows. Two robust variants of the minimum-cost integer flow problem are considered. Thereby, uncertainty in problem formulation is limited to arc unit costs and expressed by a…
We give a deterministic $m^{1+o(1)}$ time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities. As a consequence, we obtain the…
Minimum cost homomorphism problems can be viewed as a generalization of list homomorphism problems. They also extend two well-known graph colouring problems: the minimum colour sum problem and the optimum cost chromatic partition problem.…
We present multiscale graph-based reduction algorithms for upscaling heterogeneous and anisotropic diffusion problems. The proposed coarsening approaches begin by constructing a partitioning of the computational domain into a set of…
We study the continuum limit of discrete, nonconvex energy functionals defined on crystal lattices in dimensions $d\geq 2$. Since we are interested in energy functionals with random (stationary and ergodic) pair interactions, our problem…
We introduce a family of stochastic models motivated by the study of nonequilibrium steady states of fluid equations. These models decompose the deterministic dynamics of interest into fundamental building blocks, i.e., minimal vector…
We consider a finite horizon stochastic optimal control problem for nearest-neighbor random walk $\{X_i\}$ on the set of integers. The cost function is the expectation of exponential of the path sum of a random stationary and ergodic…
In this paper we study minimum cut and maximum flow problems on planar graphs, both in static and in dynamic settings. First, we present an algorithm that given an undirected planar graph computes the minimum cut between any two given…
This work is devoted to the analysis of the interplay between internal variables and high-contrast microstructure in inelastic solids. As a concrete case-study, by means of variational techniques, we derive a macroscopic description for an…
Let $G$ be an edge-weighted directed graph with $n$ vertices embedded on an orientable surface of genus $g$. We describe a simple deterministic lexicographic perturbation scheme that guarantees uniqueness of minimum-cost flows and shortest…
Flows and colorings are disparate concepts in graph algorithms -- the former is tractable while the latter is intractable. Tutte introduced the concept of nowhere-zero flows to unify these two concepts. Jaeger showed that nowhere-zero flows…
We present a new approach to the minimum-cost integral flow problem for small values of the flow. It reduces the problem to the tests of simple multi-variate polynomials over a finite field of characteristic two for non-identity with zero.…
We study traffic flow on roads with a localized periodic inhomogeneity such as traffic signals, using a stochastic car-following model. We find that in cases of congestion, traffic flow can be optimized by controlling the inhomogeneity's…
The aim of this article is to study the asymptotic behaviour of some low-cost control problems. These problems motivate the study of H-convergence with weakly convergingdata. An improved lower bound for the limit of energy functionals…
In this paper, we will provide the the finite element method for the electro-osmotic flow in micro-channels, in which a convection-diffusion type equation is given for the charge density $\rho^e$. A time-discrete method based on the…