A fast cost scaling algorithm for submodular flow
From MaRDI portal
(Redirected from Publication:294751)
Recommendations
Cites work
- scientific article; zbMATH DE number 3718824 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 1263281 (Why is no real title available?)
- scientific article; zbMATH DE number 1303553 (Why is no real title available?)
- scientific article; zbMATH DE number 1342135 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- A PRIMAL ALGORITHM FOR THE SUBMODULAR FLOW PROBLEM WITH MINIMUM-MEAN CYCLE SELECTION
- A Primal-Dual Algorithm for Submodular Flows
- A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
- A capacity scaling algorithm for convex cost submodular flows
- A dual algorithm for submodular flow problems
- A faster capacity scaling algorithm for minimum cost submodular flow
- A new approach to the maximum-flow problem
- A polynomial cycle canceling algorithm for submodular flows
- A submodular network simplex method
- ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
- An application of simultaneous diophantine approximation in combinatorial optimization
- An out-of-kilter method for submodular flows
- Computing Maximal “Polymatroidal” Network Flows
- Finding Minimum-Cost Circulations by Successive Approximation
- Finding feasible vectors of Edmonds-Giles polyhedra
- Finding minimum-cost flows by double scaling
- Generalized polymatroids and submodular flows
- Geometric algorithms and combinatorial optimization
- Layered Augmenting Path Algorithms
- Minimization on submodular flows
- Minimum cost flow with set-constraints
- Negative circuits for flows and submodular flows
- New algorithms for the intersection problem of submodular systems
- On the computational behavior of a polynomial-time network flow algorithm
- Scaling algorithms for network problems
- Submodular functions and optimization
Cited in
(14)- A Primal-Dual Algorithm for Submodular Flows
- A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
- Lattice polyhedra and submodular flows
- Minimizing a sum of submodular functions
- scientific article; zbMATH DE number 3956777 (Why is no real title available?)
- The \(b\)-branching problem in digraphs
- scientific article; zbMATH DE number 1303553 (Why is no real title available?)
- A capacity scaling algorithm for M-convex submodular flow
- Simple push-relabel algorithms for matroids and submodular flows
- A faster capacity scaling algorithm for minimum cost submodular flow
- Integer Programming and Combinatorial Optimization
- Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- Fast cycle canceling algorithms for minimum cost submodular flow
This page was built for publication: A fast cost scaling algorithm for submodular flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294751)
