Massively parallel augmenting path algorithms for the assignment problem
From MaRDI portal
Publication:1365535
DOI10.1007/BF02684400zbMath0881.90090MaRDI QIDQ1365535
Publication date: 4 September 1997
Published in: Computing (Search for Journal in Brave)
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80) Parallel numerical computation (65Y05)
Related Items (2)
Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies ⋮ A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem
Uses Software
Cites Work
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- The auction algorithm: A distributed relaxation method for the assignment problem
- Algorithms for the Assignment and Transportation Problems
- A new algorithm for the assignment problem
- An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Massively parallel augmenting path algorithms for the assignment problem