Asymptotic Moments of the Bottleneck Assignment Problem

DOI10.1287/moor.1110.0493zbMath1243.90243OpenAlexW2091839412MaRDI QIDQ2884271

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (1)

Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making

This page was built for publication: Asymptotic Moments of the Bottleneck Assignment Problem