186 search results - page 3 / 38 » The Partial Augment-Relabel Algorithm for the Maximum Flow P... |
NETWORKS
2006
13 years 7 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
MOR
2000
13 years 7 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—This paper deals with estimation of the concentration of target molecules in a fluid when it flows past multiple biosensors. The fluid flow is modelled as an advecti...
MOR
2008
13 years 7 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
