AbstractThis paper presents a cost-scaling algorithm for minimum cost 0–1 submodular flows. The algorithm works by splitting the arc costs approximately and maintaining an optimal submodular pseudoflow with respect to the split costs obtained by a greedy algorithm. Each scaling phase of the algorithm is a hybrid version of an auction-like method with cost-splitting and a successive-shortest-path method, as a generalization of Orlin and Ahuja's algorithm for the assignment problem
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has ...
We consider the minimum cost network flow problem min(cx: Ax=b, x> 0) on a graph G = (V,E). First...
AbstractThis paper presents a cost-scaling algorithm for minimum cost 0–1 submodular flows. The algo...
We describe an O/(n exp.4 h min{log U, n exp.2 log n}) capacity scaling algorithm for the minimum co...
We describe an O(n 4 h min{log U, n 2 log n}) capacity scaling algorithm for the minimum cost submod...
This paper presents a scaling scheme for submodular functions. A small but strictly submodular funct...
In this paper, we suggest new scaling algorithms for the assignment and minimum cycle mean problems....
Several researchers have recently developed new techniques that give fast algorithms for the minimum...
The cost-scaling algorithm of Goldberg and Tarjan [1990] is known to be one of the most efficient al...
. The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow ...
We propose a new algorithm for the max-flow problem. It consists of a sequence of augmen-tations alo...
We present a novel alg orithm for the min-cost flow problem that is competitive with recent third-pa...
An efficient polynomial time algorithm forsolving minimum cost flow problems has been proposedin thi...
Caption title.Includes bibliographical references (p. 40-43).by Dimitri P. Bertsekas and David A. Ca...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has ...
We consider the minimum cost network flow problem min(cx: Ax=b, x> 0) on a graph G = (V,E). First...
AbstractThis paper presents a cost-scaling algorithm for minimum cost 0–1 submodular flows. The algo...
We describe an O/(n exp.4 h min{log U, n exp.2 log n}) capacity scaling algorithm for the minimum co...
We describe an O(n 4 h min{log U, n 2 log n}) capacity scaling algorithm for the minimum cost submod...
This paper presents a scaling scheme for submodular functions. A small but strictly submodular funct...
In this paper, we suggest new scaling algorithms for the assignment and minimum cycle mean problems....
Several researchers have recently developed new techniques that give fast algorithms for the minimum...
The cost-scaling algorithm of Goldberg and Tarjan [1990] is known to be one of the most efficient al...
. The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow ...
We propose a new algorithm for the max-flow problem. It consists of a sequence of augmen-tations alo...
We present a novel alg orithm for the min-cost flow problem that is competitive with recent third-pa...
An efficient polynomial time algorithm forsolving minimum cost flow problems has been proposedin thi...
Caption title.Includes bibliographical references (p. 40-43).by Dimitri P. Bertsekas and David A. Ca...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has ...
We consider the minimum cost network flow problem min(cx: Ax=b, x> 0) on a graph G = (V,E). First...
DOI
Add to ORKG