On k-max-optimization

On k-max-optimization

0.00 Avg rating—0 Votes
Article ID: iaor20102922
Volume: 37
Issue: 1
Start Page Number: 23
End Page Number: 26
Publication Date: Jan 2009
Journal: Operations Research Letters
Authors: ,
Abstract:

We generalize bottleneck objectives in combinatorial optimization by minimizing the kth 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.

Reviews

Required fields are marked *. Your email address will not be published.