Duin, C.W.; Volgenant, A. - In: European Journal of Operational Research 221 (2012) 1, pp. 1-6
Two criteria in a combinatorial problem are often combined in a weighted sum objective using a weighting parameter between 0 and 1. For special problem types, e.g., when one of the criteria is a bottleneck value, efficient algorithms are known that solve for a given value of the weighting parameter.
