A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem

MaRDI QIDQ4900984zbMATH OpenFDO

Authors Deguo Xiong, Yongwen Hu

Publication date 24 January 2013

zbMATH Keywords

assignment problemcomplementary slackness conditionsminimum cost flow problempermissible edge algorithmprinciple of duality

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Recommendations

• A new algorithm for the assignment problem: An alternative to the Hungarian method
• scientific article; zbMATH DE number 515938
• The recurrent method to solve the assignment problem
• An efficient cost scaling algorithm for the assignment problem
• Method of sequential modification of the objective function in the assignment problem

Cited in

(3)

• A new algorithm for solving a special matching problem with a general form value function under constraints
• The recurrent method to solve the assignment problem
• scientific article; zbMATH DE number 515938 (Why is no real title available?)

This page was built for publication: A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem

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