On k-max-optimization

Authors:
Jochen Gorski;Stefan Ruzika
Affiliations:
University of Wuppertal, Faculty of Mathematics and Natural Sciences, Department of Mathematics and Informatics, Gauístr. 20, 41097 Wuppertal, Germany;University of Kaiserslautern, Department of Mathematics, P.O.Box 3049, Paul-Ehrlich-Str. 14, 67653 Kaiserslautern, Germany
Venue:
Operations Research Letters
Year:
2009

Citing 6
Cited 1

Single-facility resource allocation under capacity-based economies and diseconomics of scope

Management Science
Spanning Trees---Short or Small

SIAM Journal on Discrete Mathematics
On k-sum optimization

Operations Research Letters
Lexicographic bottleneck combinatorial problems

Operations Research Letters
An improved general procedure for lexicographic bottleneck problems

Operations Research Letters
Lexicographic balanced optimization problems

Operations Research Letters

Multicriteria 0-1 knapsack problems with k-min objectives

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.