A comparison of two algorithms for the assignment problem
From MaRDI portal
Publication:1804373
DOI10.1007/BF01299157zbMath0834.90091MaRDI QIDQ1804373
Publication date: 1 April 1996
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Linear programming (90C05) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (3)
The assignment problem revisited ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ A forward/reverse auction algorithm for asymmetric assignment problems
Cites Work
- Unnamed Item
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Dual coordinate step methods for linear network flow problems
- The auction algorithm: A distributed relaxation method for the assignment problem
- An algorithm to solve them ×n assignment problem in expected timeO(mn logn)
- A new algorithm for the assignment problem
- An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
- Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A parallel shortest augmenting path algorithm for the assignment problem
- On some techniques useful for solution of transportation network problems
This page was built for publication: A comparison of two algorithms for the assignment problem
