The recurrent method to solve the assignment problem

DOI10.1007/S10559-015-9786-XzbMATH Open1334.90067OpenAlexW2341912396MaRDI QIDQ269147FDOQ269147

Authors: O. B. Matsiy, A. V. Morozov, A. V. Panishev 

Publication date: 18 April 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-015-9786-x

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

zbMATH Keywords

matchingassignment problembipartite graphaugmenting path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)

Cited In (10)

• A reduction approach to the repeated assignment problem
• A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem
• Title not available (Why is that?)
• Extension of Egervàry theorem on optimal solution of assignment problem: logical approach
• A recurrent algorithm for solving a combinatorial problem of arrangement with restrictions
• Ones assignment method for solving assignment problems
• A new method of solving assignment problems -- the target value submatrix method
• A new algorithm for solving a special matching problem with a general form value function under constraints
• The partial orthogonalization process and its application to the optimal assignment problem
• Method of sequential modification of the objective function in the assignment problem

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)