| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10346225 | Computers & Operations Research | 2013 | 16 Pages |
Abstract
Numerical experiments with different types of MkMIN-KP instances with two k-min objectives show that the hybrid algorithm can find the complete nondominated set significantly faster with much less memory requirements than a sequential DP algorithm. We also evaluate the effect of different combinations of k values of the k-min objectives on the cardinality of the nondominated set, solution time and memory requirements of the algorithm.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Aiying Rong, Kathrin Klamroth, José Rui Figueira,