Fast cycle canceling algorithms for minimum cost submodular flow
From MaRDI portal
Publication:1882113
DOI10.1007/s00493-003-0030-3zbMath1099.90052OpenAlexW1986273263MaRDI QIDQ1882113
Maiko Shigeno, Satoru Iwata, S. Thomas McCormick
Publication date: 19 October 2004
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-003-0030-3
Programming involving graphs or networks (90C35) Convex programming (90C25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items
Finding a Stable Allocation in Polymatroid Intersection, The \(b\)-branching problem in digraphs, Unnamed Item, A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives
