A generalization of the assignment problem, and its application to the rank aggregation problem

MaRDI QIDQ5445182zbMATH OpenFDO

Authors Florin Manea, Călina Ploscaru

Publication date 3 March 2008

zbMATH Keywords

assignment problemnetwork flowrank aggregation problemranking

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Recommendations

• A note on a new variant of Murty's ranking assignments algorithm
• A note on permutations and rank aggregation
• An algorithm for rank aggregation problem
• An algorithm for ranking assignments using reoptimization
• A network flow algorithm for solving generalized assignment problem

Cited in

(7)

• A note on a new variant of Murty's ranking assignments algorithm
• On the hardness of maximum rank aggregation problems
• An algorithm for rank aggregation problem
• A rank-based approach to the sequential selection and assignment problem
• A ranking method for the assignment problem with multiple optimal solutions
• A note on permutations and rank aggregation
• A note on generalized rank aggregation

This page was built for publication: A generalization of the assignment problem, and its application to the rank aggregation problem

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