A labeling algorithm to solve the assignment problem

DOI10.1016/0305-0548(89)90028-2MaRDI QIDQ1823140zbMATH OpenOpenAlexFDO

Authors Vahid Lotfi

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0305-0548(89)90028-2

zbMATH Keywords

assignmentHungarian methodlabeling algorithmmaximum-flow formulation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Boolean programming (90C09) Integer programming (90C10)

Review text

This paper describes a simple labeling algorithm to solve the assignment problem. The labeling approach is based on the maximum-flow formulation of the problem of finding the fewest number of lines to cover all zeros in the reduced assignment matrix. The approach is useful for educational purposes as well as programming environments. The labeling procedure can be used without requiring familiarity with the maximum-flow problem.

Recommendations

• A simplex-based labelling algorithm for the linear fractional assignment problem
• A labeling algorithm for the fuzzy assignment problem.
• A new algorithm for the assignment problem: An alternative to the Hungarian method
• scientific article; zbMATH DE number 3989103
• The Hungarian method for the assignment problem

Cited in

(14)

• Personnel placement in a fuzzy environment
• A new algorithm for the assignment problem: An alternative to the Hungarian method
• Algorithms for the multiple label placement problem
• A two-phase heuristic algorithm for the label printing problem
• Adaptive labeling algorithms for the dynamic assignment problem
• scientific article; zbMATH DE number 5178701 (Why is no real title available?)
• scientific article; zbMATH DE number 4127004 (Why is no real title available?)
• scientific article; zbMATH DE number 515938 (Why is no real title available?)
• scientific article; zbMATH DE number 1057929 (Why is no real title available?)
• scientific article; zbMATH DE number 1759551 (Why is no real title available?)
• A parametric visualization software for the assignment problem
• A simplex-based labelling algorithm for the linear fractional assignment problem
• scientific article; zbMATH DE number 222693 (Why is no real title available?)
• Two heuristics for the label printing problem

This page was built for publication: A labeling algorithm to solve the assignment problem

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