scientific article; zbMATH DE number 3989103

From MaRDI portal
Publication:3751373





[For the entire collection see Zbl 0599.00013.] The paper presents a survey on linear assignment problems. Both polynomially solvable cases (min-sum assignment problem, min-max assignment problem, balanced assignment problem) and NP-hard cases (generalized assignment problem) are considered. The most efficient exact algorithms from the literature are described and compared both through their computational complexity and their average performance on randomly generated test problems. Approximate algorithms for the generalized assignment problem are also discussed.




Cited in
(62)








This page was built for publication:

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