scientific article; zbMATH DE number 515923

MaRDI QIDQ4283435zbMATH OpenFDO

Authors

Publication date 10 March 1994

zbMATH Keywords

heuristicsdata structuresGoldberg-Tarjan algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• scientific article; zbMATH DE number 515922
• On implementing the push-relabel method for the maximum flow problem
• On the complexity of preflow-push algorithms for maximum-flow problems
• Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm

Cited in

(9)

• scientific article; zbMATH DE number 515922 (Why is no real title available?)
• On implementing push-relabel method for the maximum flow problem
• An efficient cost scaling algorithm for the assignment problem
• scientific article; zbMATH DE number 515926 (Why is no real title available?)
• Computational investigations of maximum flow algorithms
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• Implementing the Ford-Fulkerson labeling algorithm with fixed-order scanning
• Recent developments in maximum flow algorithms
• An auction algorithm for the max-flow problem

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 Q4283435)