Algorithm and Average-value Bounds for Assignment Problems

DOI10.1147/rd.134.0380zbMath0217.27203OpenAlexW1986231013MaRDI QIDQ5621265

Wilm Donath

Publication date: 1969

Published in: IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1147/rd.134.0380

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations ⋮ Exploiting partial correlations in distributionally robust optimization ⋮ Random assignment problems ⋮ Selected topics on assignment problems ⋮ Efficient algorithms for three‐dimensional axial and planar random assignment problems ⋮ Uncertain programming model for uncertain optimal assignment problem ⋮ Uncertain random assignment problem ⋮ Constructive bounds and exact expectations for the random assignment problem ⋮ An asymptotical study of combinatorial optimization problems by means of statistical mechanics ⋮ On the expected optimal value of random assignment problems: Experimental results and open questions