On the expected number of assignments in reduced matrices for the linear assignment problem

DOI10.1016/0167-6377(89)90018-7zbMath0682.90075OpenAlexW2012107091MaRDI QIDQ1824561

Yanyan Li

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/on-the-expected-number-of-assignments-in-reduced-matrices-for-the-linear-assignment-problem(71b77ee8-4439-4f76-ab79-aad39d631bcc).html

zbMATH Keywords

bipartite graphmatchinglinear assignment problemoccupancy problemstochastic assignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Workers' placement in an industrial environment ⋮ Personnel placement in a fuzzy environment ⋮ Some recent results in the analysis of greedy algorithms for assignment problems

Cites Work

• On some generalized farlie-gumbel-morgenstern distributions-II regression, correlation and further generalizations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the expected number of assignments in reduced matrices for the linear assignment problem