期刊
MANAGEMENT SCIENCE
卷 56, 期 12, 页码 2302-2315出版社
INFORMS
DOI: 10.1287/mnsc.1100.1248
关键词
multiobjective optimization; nondominated points; exact algorithm
In this paper, we present an exact algorithm to find all extreme supported nondominated points of multiobjective mixed integer programs. The algorithm uses a composite linear objective function and finds all the desired points in a finite number of steps by changing the weights of the objective functions in a systematic way. We develop further variations of the algorithm to improve its computational performance and demonstrate our algorithm's performance on multiobjective assignment, knapsack, and traveling salesperson problems with three and four objectives.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据