Name
Abstract | ||
|---|---|---|
In this paper, we present an approach, based on dynamic programming, for solving the 0-1 multi-objective knapsack problem. The main idea of the approach relies on the use of several complementary dominance relations to discard partial solutions that cannot lead to new non-dominated criterion vectors. This way, we obtain an efficient method that outperforms the existing methods both in terms of CPU time and size of solved instances. Extensive numerical experiments on various types of instances are reported. A comparison with other exact methods is also performed. In addition, for the first time to our knowledge, we present experiments in the three-objective case. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.cor.2007.09.009 | Computers & OR |
Keywords | Field | DocType |
main idea,extensive numerical experiment,efficient solutions,present experiment,non-dominated criterion vectors,exact method,efficient method,dynamic programming,multi-objective knapsack problem,existing method,CPU time,combinatorial optimization.,complementary dominance relation,dominance relations | Dynamic programming,Mathematical optimization,Combinatorial optimization,Knapsack problem,Mathematics | Journal |
Volume | Issue | ISSN |
36 | 1 | Computers and Operations Research |
Citations | PageRank | References |
24 | 1.27 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristina Bazgan | 1 | 679 | 62.76 |
| Hadrien Hugot | 2 | 47 | 3.25 |
| Daniel Vanderpooten | 3 | 1153 | 74.66 |