| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524056 | Operations Research Letters | 2005 | 4 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hansjörg Albrecher,