A note on Hungarian algorithm for assignment problems

DOI10.13568/J.CNKI.651094.2015.03.006MaRDI QIDQ2991031zbMATH OpenFDO

Authors Zhiming Li

Publication date 10 August 2016

Full work available at URL https://doi.org/10.13568/J.CNKI.651094.2015.03.006

zbMATH Keywords

assignment problemoptimal solutionHungarian algorithmefficiency matrix

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• A note of reduced dimension optimization algorithm of assignment problem
• A new algorithm for the assignment problem: An alternative to the Hungarian method
• scientific article; zbMATH DE number 1179832
• Contributions to the hungarian method
• The Hungarian method for the assignment problem

Cited in

(12)

• scientific article; zbMATH DE number 4027176 (Why is no real title available?)
• A note of reduced dimension optimization algorithm of assignment problem
• Algorithm for the minimax assignment problem with a sparse rectangular matrix
• Extension of Egervàry theorem on optimal solution of assignment problem: logical approach
• Ones assignment method for solving assignment problems
• Revisiting the 0,1 assignment problem
• scientific article; zbMATH DE number 5556493 (Why is no real title available?)
• On the problem of transversal selection
• Parallel Asynchronous Hungarian Methods for the Assignment Problem
• Classes of matrices associated with the optimal assignment problem
• The partial orthogonalization process and its application to the optimal assignment problem
• A new algorithm for the assignment problem: An alternative to the Hungarian method

This page was built for publication: A note on Hungarian algorithm for assignment problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2991031)