TY - RPRT
A1 - Ehrgott, Matthias
T1 - Lexicographic Max-Ordering - A Solution Concept for Multicriteria Combinatorial Optimization
N2 - In this paper we will introduce the concept of lexicographic max-ordering solutions for multicriteria combinatorial optimization problems. Section 1 provides the basic notions of
multicriteria combinatorial optimization and the definition of lexicographic max-ordering solutions. In Section 2 we will show that lexicographic max-ordering solutions are pareto optimal as well as max-ordering optimal solutions. Furthermore lexicographic max-ordering solutions can be used to characterize the set of pareto solutions. Further properties of lexicographic max-ordering solutions are given. Section 3 will be devoted to algorithms. We give a polynomial time algorithm for the two criteria case where one criterion is a sum and one is a bottleneck objective function, provided that the one criterion sum problem is solvable in polynomial time. For bottleneck functions an algorithm for the general case of Q criteria is presented.
T3 - Preprints (rote Reihe) des Fachbereich Mathematik - 268
Y1 - 1995
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/4849
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-48498
ER -