| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143432 | Operations Research Letters | 2009 | 4 Pages |
Abstract
We generalize bottleneck objectives in combinatorial optimization by minimizing the kkth largest cost coefficient in a feasible solution. A bisection algorithm is presented which is based on iteratively solving an associated sum objective problem with binary cost coefficients. This algorithm is applicable to general combinatorial optimization problems.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jochen Gorski, Stefan Ruzika,