A note on the asymptotic behaviour of bottleneck problems

DOI10.1016/j.orl.2004.04.010zbMath1099.90048OpenAlexW2025345886MaRDI QIDQ2488222

Hansjoerg Albrecher

Publication date: 25 August 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.04.010

zbMATH Keywords

Bottleneck problemsProbabilistic error bounds

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (5)

The random quadratic assignment problem ⋮ Quadratic bottleneck problems ⋮ Random assignment problems ⋮ An asymptotical study of combinatorial optimization problems by means of statistical mechanics ⋮ Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making

Cites Work

• Unnamed Item
• Probabilistic asymptotic properties of some combinatorial optimization problems
• An asymptotical study of combinatorial optimization problems by means of statistical mechanics
• Stochastic Analysis of the Quadratic Assignment Problem
• Asymptotic Properties of the Quadratic Assignment Problem
• On random quadratic bottleneck assignment problems
• Combinational optimization problems for which almost every algorithm is asymptotically optimal
• The random linear bottleneck assignment problem

This page was built for publication: A note on the asymptotic behaviour of bottleneck problems