Name
Abstract | ||
|---|---|---|
In the present work, we are interested in the practical behavior of a new fully polynomial time approximation schemes (fptas) to solve the approximation version of the 0–1 multi-objective knapsack problem. The proposed methodology makes use of very general techniques (such as dominance relations in dynamic programming) and thus may be applicable in the implementation of fptas for other problems as well. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ejor.2008.07.047 | European Journal of Operational Research |
Keywords | Field | DocType |
Multi-objective knapsack problem,Approximation,Dynamic programming,Dominance relations,Combinatorial optimization | Dynamic programming,Approximation algorithm,Mathematical optimization,CPU time,Continuous knapsack problem,Multiobjective programming,Combinatorial optimization,Knapsack problem,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
198 | 1 | 0377-2217 |
Citations | PageRank | References |
17 | 0.72 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristina Bazgan | 1 | 679 | 62.76 |
| Hadrien Hugot | 2 | 47 | 3.25 |
| Daniel Vanderpooten | 3 | 1153 | 74.66 |