On Approximation Methods for the Assignment Problem

DOI10.1145/321138.321140MaRDI QIDQ3844783zbMATH OpenOpenAlexFDO

Authors Jerome M. Kurtzberg

Publication date 1962

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321138.321140

zbMATH Keywords

applications of probability theory and statistics

Cited in

(9)

• An analysis of a decomposition heuristic for the assignment problem
• The planted matching problem: phase transitions and exact results
• Exploiting partial correlations in distributionally robust optimization
• Uncertain random assignment problem
• Linear-time approximation for maximum weight matching
• A survey of heuristics for the weighted matching problem
• Constructive bounds and exact expectations for the random assignment problem
• A particle swarm optimizer for grouping problems
• Random assignment problems

This page was built for publication: On Approximation Methods for the Assignment Problem

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