Massively parallel augmenting path algorithms for the assignment problem
From MaRDI portal
Publication:1365535
DOI10.1007/BF02684400zbMATH Open0881.90090MaRDI QIDQ1365535FDOQ1365535
Publication date: 4 September 1997
Published in: Computing (Search for Journal in Brave)
Parallel numerical computation (65Y05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for the Assignment and Transportation Problems
- Title not available (Why is that?)
- A new algorithm for the assignment problem
- An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
- Title not available (Why is that?)
Cited In (5)
- Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies
- A parallel shortest augmenting path algorithm for the assignment problem
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem
- Implementing (nondeterministic) parallel assignments
- A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
Uses Software
Recommendations
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)
