A new method of solving assignment problems -- the target value submatrix method

DOI10.3785/J.ISSN.1008-9497.2010.05.004MaRDI QIDQ3017061zbMATH OpenFDO

Authors Honggang Zhao, Zhujun Yang, Qing-Hua Meng, Jingui Gao

Publication date 19 July 2011

Full work available at URL https://doi.org/10.3785/J.ISSN.1008-9497.2010.05.004

zbMATH Keywords

computation quantitytarget value submatrix methodtraditional assignment problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Integer programming (90C10)

Recommendations

• Method of sequential modification of the objective function in the assignment problem
• The recurrent method to solve the assignment problem
• Ones assignment method for solving assignment problems
• A new algorithm for the assignment problem: An alternative to the Hungarian method
• Revisiting the 0,1 assignment problem

Cited in

(4)

• The recurrent method to solve the assignment problem
• The partial orthogonalization process and its application to the optimal assignment problem
• Method of sequential modification of the objective function in the assignment problem
• Ones assignment method for solving assignment problems

This page was built for publication: A new method of solving assignment problems -- the target value submatrix method

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