Parallel algorithms for the assignment and minimum-cost flow problems

DOI10.1016/0167-6377(93)90068-RMaRDI QIDQ1319670zbMATH OpenOpenAlexWikidataFDO

Authors James B. Orlin, Clifford Stein

Publication date 12 April 1994

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(93)90068-r

zbMATH Keywords

assignment problembipartite matchingminimum-cost flowparallel algorithmscaling

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Deterministic network models in operations research (90B10)

Recommendations

• A fast parallel algorithm for minimum-cost small integral flows
• Faster Scaling Algorithms for Network Problems
• scientific article; zbMATH DE number 1163097
• Efficient parallel algorithms for the minimum cost flow problem
• Finding minimum-cost flows by double scaling

Cites work

• Constructing a perfect matching is in random NC
• Faster Scaling Algorithms for Network Problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• scientific article; zbMATH DE number 4204092 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Matching is as easy as matrix inversion
• Parallelism in random access machines
• Scaling algorithms for network problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(10)

• Efficient parallel algorithms for the minimum cost flow problem
• A fast parallel algorithm for minimum-cost small integral flows
• Parallel Algorithms for Zero-One Supply-Demand Problems
• Parallel Asynchronous Hungarian Methods for the Assignment Problem
• scientific article; zbMATH DE number 515940 (Why is no real title available?)
• scientific article; zbMATH DE number 6861895 (Why is no real title available?)
• Approximate Max-Flow on Small Depth Networks
• Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
• A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM
• Derandomizing isolation in space-bounded settings

This page was built for publication: Parallel algorithms for the assignment and minimum-cost flow problems

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