Abstract
This algorithm is a companion to [3] where the theoretical background is described.
- 1 Silver, R. An Algorithm for the assignment problem. Comm. ACM 3 (Nov. 1960), 605-606. Google ScholarDigital Library
- 2 Munkres, J. Algorithms for the assignment and transportation problems. J. SIAM5 (Mar. 1957), 32-38.Google Scholar
- 3 Bourgeois, F. and Lassalle, J. C. An extension of the Munkres algorithm for the assignment problem to rectangular matrices. Comm. ACM 15 (Dec. 1971), 802-804. Google ScholarDigital Library
Recommendations
An extension of the Munkres algorithm for the assignment problem to rectangular matrices
The assignment problem, together with Munkres proposed algorithm for its solution in square matrices, is presented first. Then the authors develop an extension of this algorithm which permits a solution for rectangular matrices.
Timing results obtained ...
On the Computation of Null Spaces of Sparse Rectangular Matrices
Computing the null space of a sparse matrix is an important part of some computations, such as embeddings and parametrization of meshes. We propose an efficient and reliable method to compute an orthonormal basis of the null space of a sparse square or ...
Solving the Many to Many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
The Many to Many (M-M) assignment problem is an important open problem where one task is assigned to many, but different, agents and one agent may undertake many, but different, tasks. The Kuhn-Munkres (K-M) algorithm is a famous and traditional process ...
Comments