On weighting two criteria with a parameter in combinatorial optimization problems |
| |
| Authors: | C.W. Duin A. Volgenant |
| |
| Affiliation: | Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam, Valckeniersstraat 65, 1018 XE Amsterdam, Netherlands |
| |
| Abstract: | 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. |
| |
| Keywords: | Bicriteria combinatorial problems Spanning tree Linear assignment Single machine scheduling |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
