A faster capacity scaling algorithm for minimum cost submodular flow
From MaRDI portal
Publication:1600097
DOI10.1007/s101070100253zbMath1046.90073OpenAlexW2071642760MaRDI QIDQ1600097
S. Thomas McCormick, Satoru Iwata, Lisa K. Fleischer
Publication date: 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100253
Related Items (10)
A fast cost scaling algorithm for submodular flow ⋮ Finding a Stable Allocation in Polymatroid Intersection ⋮ Lattice polyhedra and submodular flows ⋮ The \(b\)-branching problem in digraphs ⋮ Unnamed Item ⋮ A push-relabel framework for submodular function minimization and applications to parametric optimization ⋮ Minimizing a sum of submodular functions ⋮ A capacity scaling algorithm for M-convex submodular flow ⋮ Submodular function minimization ⋮ A fully combinatorial algorithm for submodular function minimization.
This page was built for publication: A faster capacity scaling algorithm for minimum cost submodular flow
