A note on the asymptotic behaviour of bottleneck problems

Operations Research Letters

Volumn 33, Issue 2, 2005, Pages 183-186

  Albrecher, Hansjörg ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Bottleneck problems; Probabilistic error bounds

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERRORS; FUNCTIONS; GRAPH THEORY; OPERATIONS RESEARCH; PROBABILITY;

ASYMPTOTIC BEHAVIOR; BOTTLENECK PROBLEMS; PROBABILISTIC ERROR BOUNDS;

PROBLEM SOLVING;

EID: 9644264303     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.04.010     Document Type: Article

References (8)

1. H. Albrecher, R.E. Burkard, E. Cela, An asymptotical study of combinatorial optimization problems by means of statistical mechanics, SFB Report 267, Graz University of Technology, 2003.
2. P. Billingsley, Probability and Measure, 3rd Edition, Wiley, New York, 1995.
3. R.E. Burkard, U. Fincke, On random quadratic bottleneck assignment problems, Math. Programming 23 (2) (1982) 227-232.
4. R.E. Burkard, U. Fincke, Probabilistic asymptotic properties of some combinatorial optimization problems, Discrete Appl. Math. 12 (1) (1985) 21-29.
5. J.B.G. Frenk, M. van Houweninge, A.H.G. Rinnooy Kan, Asymptotic properties of the quadratic assignment problem, Math. Oper. Res. 10 (1) (1985) 100-116.
6. U. Pferschy, The random linear bottleneck assignment problem, RAIRO Rech. Opér. 30 (2) (1996) 127-142.
7. W.T. Rhee, Stochastic analysis of the quadratic assignment problem, Math. Oper. Res. 16 (2) (1991) 223-239.
8. W. Szpankowski, Combinatorial optimization problems for which almost every algorithm is asymptotically optimal!, Optimization 33 (4) (1995) 359-367.