A note on the asymptotic behaviour of bottleneck problems

  • Authors:
  • HansjöRg Albrecher

  • Affiliations:
  • Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-8010 Graz, Austria

  • Venue:
  • Operations Research Letters
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We generalize and sharpen results of Burkard and Fincke concerning the asymptotic behaviour of a certain class of combinatorial optimization problems with bottleneck objective function. In this way several open questions are answered.