scientific article; zbMATH DE number 1303553

MaRDI QIDQ4250177zbMATH OpenFDO

Authors Satoru Iwata, S. Thomas McCormick, Maiko Shigeno

Publication date 17 June 1999

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• A fast cost scaling algorithm for submodular flow
• A faster capacity scaling algorithm for minimum cost submodular flow
• Fast cycle canceling algorithms for minimum cost submodular flow
• A cost-scaling algorithm for \(0-1\) submodular flows
• Improved algorithms for submodular function minimization and submodular flow
• A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
• A Primal-Dual Algorithm for Submodular Flows
• scientific article; zbMATH DE number 1263274
• Fast algorithms for specially structured minimum cost flow problems with applications
• Publication:4886083

Cited in

(13)

• A PRIMAL ALGORITHM FOR THE SUBMODULAR FLOW PROBLEM WITH MINIMUM-MEAN CYCLE SELECTION
• A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
• Lattice polyhedra and submodular flows
• A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
• scientific article; zbMATH DE number 3956777 (Why is no real title available?)
• A fast cost scaling algorithm for submodular flow
• An out-of-kilter method for submodular flows
• A dual algorithm for submodular flow problems
• A faster capacity scaling algorithm for minimum cost submodular flow
• scientific article; zbMATH DE number 3934774 (Why is no real title available?)
• Improved algorithms for submodular function minimization and submodular flow
• Fast cycle canceling algorithms for minimum cost submodular flow
• Shortest cycles with monotone submodular costs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250177)