Reichel, JoachimSkutella, Martin2009-05-122009-05-122008-08http://hdl.handle.net/2003/26160http://dx.doi.org/10.17877/DE290R-9027Runtime analyses of randomized search heuristics for combinatorial optimization problems often depend on the size of the largest weight. We consider replacing the given set of weights with smaller weights such that the behavior of the randomized search heuristic does not change. Upper bounds on the size of the new, equivalent weights allow us to obtain upper bounds on the expected runtime of such randomized search heuristics independent of the size of the actual weights. Furthermore we give lower bounds on the largest weights for worst-case instances. Finally we present some experimental results, including examples for worst-case instances.enanalysis of algorithms and problem complexityevolutionary algorithmsperformancerandomized search heuristicstheory of computation004Text