Asymptotic moments of the bottleneck assignment problem

DOI10.1287/MOOR.1110.0493zbMATH Open1243.90243OpenAlexW2091839412MaRDI QIDQ2884271FDOQ2884271

Authors: Michael Z. Spivey 

Publication date: 24 May 2012

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c88441cecf01b6a6f5a02ed08aa94479815cdc98

Recommendations

• The random linear bottleneck assignment problem
• The random linear bottleneck assignment problem
• scientific article; zbMATH DE number 1802784
• Constructive bounds and exact expectations for the random assignment problem
• Certain expected values in the random assignment problem

zbMATH Keywords

asymptotic analysisrandom assignment problemBottleneck assignment problemmatching degree 1 random bipartite graphprobabilistic analysis complete

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Minimax problems in mathematical programming (90C47) Combinatorial probability (60C05) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58)

Cited In (3)

• Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
• The random linear bottleneck assignment problem
• Asymptotics of the optimum in discrete sequential assignment

This page was built for publication: Asymptotic moments of the bottleneck assignment problem

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