On kk-max-optimization

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.