A new algorithm for the assignment problem: An alternative to the Hungarian method

DOI10.1016/S0305-0548(97)00019-1MaRDI QIDQ1374026zbMATH OpenOpenAlexFDO

Authors J. Ning

Publication date 2 December 1997

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0305-0548(97)00019-1

zbMATH Keywords

assignment

Mathematics Subject Classification ID

Linear programming (90C05) Boolean programming (90C09) Discrete location and assignment (90B80)

Recommendations

• A note on Hungarian algorithm for assignment problems
• The Hungarian method for the assignment problem
• scientific article; zbMATH DE number 5556493
• A new algorithm for the quasi-assignment problem
• A solution method for the quadratic assignment problem based on the Hungarian algorithm
• An algorithm for the assignment problem
• scientific article; zbMATH DE number 21745
• Improving the Hungarian assignment algorithm
• On a new algorithm for stable assignment^*
• A new look at the optimal assignment problem

Cites work

• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 3249566 (Why is no real title available?)
• A competitive (dual) simplex method for the assignment problem
• A labeling algorithm to solve the assignment problem
• An infeasible (exterior point) simplex algorithm for assignment problems
• Efficient dual simplex algorithms for the assignment problem
• New scaling algorithms for the assignment and minimum mean cycle problems
• Signature Methods for the Assignment Problem
• Solving the Assignment Problem by Relaxation
• Technical Note—A Polynomial Simplex Method for the Assignment Problem

Cited in

(21)

• scientific article; zbMATH DE number 3991510 (Why is no real title available?)
• A note on Hungarian algorithm for assignment problems
• The recurrent method to solve the assignment problem
• A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem
• A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
• A new algorithm of bearings-only multi-target tracking of bistatic system
• Data association approaches in bearings-only multi-target tracking
• Algorithm for the minimax assignment problem with a sparse rectangular matrix
• A new algorithm for stable assignment
• Threshold assignment algorithm
• New congruence method towards assignment problem
• A new method of solving assignment problems -- the target value submatrix method
• A study on two measurements-to-tracks data assignment algorithms
• scientific article; zbMATH DE number 17627 (Why is no real title available?)
• scientific article; zbMATH DE number 5556493 (Why is no real title available?)
• A labeling algorithm for the sensitivity ranges of the assignment problem
• scientific article; zbMATH DE number 515938 (Why is no real title available?)
• A labeling algorithm to solve the assignment problem
• The computational efficiency of Ji-Lee-Li algorithm for the assignment problem
• Method of sequential modification of the objective function in the assignment problem
• Classes of matrices associated with the optimal assignment problem

This page was built for publication: A new algorithm for the assignment problem: An alternative to the Hungarian method

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