A fast cost scaling algorithm for submodular flow
From MaRDI portal
Publication:294751
DOI10.1016/S0020-0190(00)00052-1zbMath1339.90325MaRDI QIDQ294751
S. Thomas McCormick, Satoru Iwata, Maiko Shigeno
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000521?np=y
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)
Related Items (4)
Lattice polyhedra and submodular flows ⋮ The \(b\)-branching problem in digraphs ⋮ Unnamed Item ⋮ Minimizing a sum of submodular functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding feasible vectors of Edmonds-Giles polyhedra
- Scaling algorithms for network problems
- An out-of-kilter method for submodular flows
- An application of simultaneous diophantine approximation in combinatorial optimization
- Generalized polymatroids and submodular flows
- Minimization on submodular flows
- A dual algorithm for submodular flow problems
- Finding minimum-cost flows by double scaling
- Submodular functions and optimization
- On the computational behavior of a polynomial-time network flow algorithm
- Negative circuits for flows and submodular flows
- New algorithms for the intersection problem of submodular systems
- Geometric algorithms and combinatorial optimization
- A capacity scaling algorithm for convex cost submodular flows
- A faster capacity scaling algorithm for minimum cost submodular flow
- A polynomial cycle canceling algorithm for submodular flows
- A submodular network simplex method
- Finding Minimum-Cost Circulations by Successive Approximation
- A Primal-Dual Algorithm for Submodular Flows
- Layered Augmenting Path Algorithms
- A PRIMAL ALGORITHM FOR THE SUBMODULAR FLOW PROBLEM WITH MINIMUM-MEAN CYCLE SELECTION
- A new approach to the maximum-flow problem
- A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
- Minimum cost flow with set-constraints
- Computing Maximal “Polymatroidal” Network Flows
- ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
This page was built for publication: A fast cost scaling algorithm for submodular flow
