On Approximation Methods for the Assignment Problem

DOI10.1145/321138.321140zbMath0108.33303OpenAlexW2032382962MaRDI QIDQ3844783

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

Related Items (9)

Linear-Time Approximation for Maximum Weight Matching ⋮ Exploiting partial correlations in distributionally robust optimization ⋮ A particle swarm optimizer for grouping problems ⋮ A survey of heuristics for the weighted matching problem ⋮ Random assignment problems ⋮ Uncertain random assignment problem ⋮ Constructive bounds and exact expectations for the random assignment problem ⋮ The planted matching problem: phase transitions and exact results ⋮ An analysis of a decomposition heuristic for the assignment problem

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