The recurrent method to solve the assignment problem
From MaRDI portal
Publication:269147
Recommendations
- A new algorithm for the assignment problem: An alternative to the Hungarian method
- Method of sequential modification of the objective function in the assignment problem
- A new method of solving assignment problems -- the target value submatrix method
- A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem
- The Hungarian method for the assignment problem
Cited in
(10)- A recurrent algorithm for solving a combinatorial problem of arrangement with restrictions
- A new method of solving assignment problems -- the target value submatrix method
- A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem
- The partial orthogonalization process and its application to the optimal assignment problem
- scientific article; zbMATH DE number 1900918 (Why is no real title available?)
- Extension of Egervàry theorem on optimal solution of assignment problem: logical approach
- Method of sequential modification of the objective function in the assignment problem
- Ones assignment method for solving assignment problems
- A reduction approach to the repeated assignment problem
- A new algorithm for solving a special matching problem with a general form value function under constraints
This page was built for publication: The recurrent method to solve the assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269147)