Massively parallel augmenting path algorithms for the assignment problem

DOI10.1007/BF02684400MaRDI QIDQ1365535zbMATH OpenFDO

Authors Sverre Storøy, Tor Sørevik

Publication date 4 September 1997

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsaugmenting path algorithmsmatching in bipartite graphsdense linear assignment

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)

Recommendations

• A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem
• A parallel shortest augmenting path algorithm for the assignment problem
• scientific article; zbMATH DE number 515940

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 39171 (Why is no real title available?)
• scientific article; zbMATH DE number 515940 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A new algorithm for the assignment problem
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Algorithms for the Assignment and Transportation Problems
• An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
• The auction algorithm: A distributed relaxation method for the assignment problem

Cited in

(6)

• Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies
• Algorithms for assignment problems on an array processor
• A parallel shortest augmenting path algorithm for the assignment problem
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• Implementing (nondeterministic) parallel assignments
• A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: Massively parallel augmenting path algorithms for the assignment problem

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