TY - RPRT
A1 - HÃ¼sselmann, Claus
A1 - Hamacher, Horst W.
T1 - Ranking Approach to Max-Ordering Combinatorial Optimization and Network Flows
N2 - Max ordering (MO) optimization is introduced as tool for modelling production
planning with unknown lot sizes and in scenario modelling. In MO optimization a feasible solution set \(X\) and, for each \(x\in X, Q\) individual objective functions \(f_1(x),\dots,f_Q(x)\) are given. The max ordering objective
\(g(x):=max\) {\(f_1(x),\dots,f_Q(x)\)} is then minimized over all \(x\in X\).
The paper discusses complexity results and describes exact and approximative
algorithms for the case where \(X\) is the solution set of combinatorial
optimization problems and network flow problems, respectively.
T3 - Preprints (rote Reihe) des Fachbereich Mathematik - 246
Y1 - 1993
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/5044
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-50441
ER -