A submodular network simplex method
From MaRDI portal
Recommendations
Cited in
(17)- An out-of-kilter method for submodular flows
- Directed submodularity, ditroids and directed submodular flows
- An application of submodular flows
- Submodular flow problem with a nonseparable cost function
- A dual algorithm for submodular flow problems
- Submodular functions in problems of synthesis of networks
- Fast cycle canceling algorithms for minimum cost submodular flow
- Fair integral submodular flows
- Submodular containment is hard, even for networks
- Substitutes and complements in network flows viewed as discrete convexity
- A submodular optimization problem with side constraints
- A fast cost scaling algorithm for submodular flow
- scientific article; zbMATH DE number 3885621 (Why is no real title available?)
- scientific article; zbMATH DE number 3847217 (Why is no real title available?)
- scientific article; zbMATH DE number 3906195 (Why is no real title available?)
- scientific article; zbMATH DE number 108290 (Why is no real title available?)
- Recent trends in combinatorial optimization
This page was built for publication: A submodular network simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220318)