On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Solving bicriteria 0-1 knapsack problems using a labeling algorithm
Computers and Operations Research
Approximating Multiobjective Knapsack Problems
Management Science
Multicriteria Optimization
An efficient implementation for the 0-1 multi-objective Knapsack problem
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Multiobjective optimization using GAI models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Efficient approximation algorithms for multi-objective constraint optimization
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
| Hi-index | 0.00 |
In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheless, our methodology focuses on 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. Extensive numerical experiments on various types of instances establish that our method performs very well both in terms of CPU time and size of solved instances. We point out some reasons for the good practical performance of our algorithm. A comparison with an exact method is also performed.