Algorithm and Average-value Bounds for Assignment Problems

DOI10.1147/RD.134.0380MaRDI QIDQ5621265zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(10)

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

This page was built for publication: Algorithm and Average-value Bounds for Assignment Problems

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