TY - INPR
A1 - Gorski, Jochen
A1 - Klamroth, Kathrin
A1 - Ruzika, Stefan
T1 - Generalized Multiple Objective Bottleneck Problems
N2 - We consider multiple objective combinatiorial optimization problems in which the first objective is of arbitrary type and the remaining objectives are either bottleneck or k-max objective functions. While the objective value of a bottleneck objective is determined by the largest cost value of any element in a feasible solution, the kth-largest element defines the objective value of the k-max objective. An efficient solution approach for the generation of the complete nondominated set is developed which is independent of the specific combinatiorial problem at hand. This implies a polynomial time algorithm for several important problem classes like shortest paths, spanning tree, and assignment problems with bottleneck objectives which are known to be NP-hard in the general multiple objective case.
T3 - Report in Wirtschaftsmathematik (WIMA Report) - 131
KW - combinatorial optimization
KW - multiple objective
KW - bottleneck
KW - k-max
Y1 - 2010
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2252
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-16686
ER -