scientific article; zbMATH DE number 515928

MaRDI QIDQ4283440zbMATH OpenFDO

Authors Andrew V. Goldberg, Michael Kharitonov

Publication date 10 March 1994

zbMATH Keywords

heuristicsminimum-cost flow algorithmsscaling push-relabel method

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1263274
• An efficient cost scaling algorithm for the assignment problem
• Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Finding minimum-cost flows by double scaling

Cited in

(6)

• On implementing push-relabel method for the maximum flow problem
• Applying steepest-edge techniques to a network primal-dual algorithm
• An efficient cost scaling algorithm for the assignment problem
• A least-squares minimum-cost network flow algorithm
• A new scaling algorithm for the minimum cost network flow problem
• Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm

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