相关论文: Adaptive Network Flow with $k$-Arc Destruction

We consider the establishment of connections in survivable networks, where each connection is allocated with a working (primary) path and a protection (backup) path. While many optimal solutions have been found for the establishment of a…

Flow-based generative models parameterize probability distributions through an invertible transformation and can be trained by maximum likelihood. Invertible residual networks provide a flexible family of transformations where only…

In this paper, we address the minimum-cost node-capacitated multiflow problem in an undirected network. For this problem, Babenko and Karzanov (2012) showed strongly polynomial-time solvability via the ellipsoid method. Our result is the…

We study the electrical distribution network reconfiguration problem, defined as follows. We are given an undirected graph with a root vertex, demand at each non-root vertex, and resistance on each edge. Then, we want to find a spanning…

In this paper, we derive a number of interesting properties and extensions of the convex flow problem from the perspective of convex geometry. We show that the sets of allowable flows always can be imbued with a downward closure property,…

We train a deep convolutional neural network to predict hydrodynamic results for flow coefficients, average transverse momenta and charged particle multiplicities in ultrarelativistic heavy-ion collisions from the initial energy density…

We prove that certain problems naturally arising in knot theory are NP--hard or NP--complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link…

The goal of this paper is to establish a decomposition of the network based on the maximum flow problem.

In this paper we develop adaptive numerical schemes for certain nonlinear variational problems. The discretization of the variational problems is done by representing the solution as a suitable frame decomposition, i.e., a complete, stable,…

Computing cohesive subgraphs is a central problem in graph theory. While many formulations of cohesive subgraphs lead to NP-hard problems, finding a densest subgraph can be done in polynomial time. As such, the densest subgraph model has…

Despite a great deal of research, it is still unclear why neural networks are so susceptible to adversarial examples. In this work, we identify natural settings where depth-$2$ ReLU networks trained with gradient flow are provably…

The relativistic hydrodynamics (RHD) equations can give rise to solutions which have shocks, contact discontinuities, and other sharp structures, which interact and evolve over time. Capturing these sharp waves effectively requires a mesh…

We study a generalization of the Steiner tree problem, where we are given a weighted network $G$ together with a collection of $k$ subsets of its vertices and a root $r$. We wish to construct a minimum cost network such that the network…

Network flow problems, which involve distributing traffic such that the underlying infrastructure is used effectively, are ubiquitous in transportation and logistics. Among them, the general Multi-Commodity Network Flow (MCNF) problem…

This paper proposes a hard-constrained unsupervised learning framework for rapidly solving the non-linear and non-convex AC optimal power flow (AC-OPF) problem in real-time operation. Without requiring ground-truth AC-OPF solutions,…

In this work, we consider a restricted case of the well studied Sorting by Block Interchanges problem. We put an upper bound k on the length of the blocks (substrings) to be interchanged at each step. We call the problem Sorting by k-Block…

This paper introduces a framework to capture previously intractable optimization constraints and transform them to a mixed-integer linear program, through the use of neural networks. We encode the feasible space of optimization problems…

Neural networks allow solving many ill-posed inverse problems with unprecedented performance. Physics informed approaches already progressively replace carefully hand-crafted reconstruction algorithms in real applications. However, these…

We provide evidence that computing the maximum flow value between every pair of nodes in a directed graph on $n$ nodes, $m$ edges,and capacities in the range $[1..n]$, which we call the All-Pairs Max-Flow problem, cannot be solved in time…

In this paper, we study the problem concerning the approximation of a rigid obstacle for flows governed by the stationary Navier-Stokes equations in the two-dimensional case. The idea is to consider a highly viscous fluid in the place of…