The computational efficiency of Ji-Lee-Li algorithm for the assignment problem

MaRDI QIDQ2867325zbMATH OpenFDO

Authors Gerold Jäger, Boris Goldengorin

Publication date 11 December 2013

Published in Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/1240

zbMATH Keywords

assignment problemHungarian algorithmdual simplex algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• Efficient dual simplex algorithms for the assignment problem
• Improving the Hungarian assignment algorithm
• A competitive (dual) simplex method for the assignment problem
• A sequential dual simplex algorithm for the linear assignment problem
• A new algorithm for the assignment problem: An alternative to the Hungarian method

This page was built for publication: The computational efficiency of Ji-Lee-Li algorithm for the assignment problem

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