Strongly polynomial Pivot algorithms for maximal flow problems

MaRDI QIDQ4615209zbMATH OpenFDO

Authors Richárd Molnár-Szipai, Tibor Illés

Publication date 1 February 2019

zbMATH Keywords

labelling techniquesmaximum flow problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On strongly polynomial dual simplex algorithms for the maximum flow problem
• Strongly polynomial dual simplex methods for the maximum flow problem
• On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
• Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
• On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds

Cited in

(4)

• On strongly polynomial dual simplex algorithms for the maximum flow problem
• Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
• A strongly polynomial algorithm for generalized flow maximization
• On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds

This page was built for publication: Strongly polynomial Pivot algorithms for maximal flow problems

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