Implementing an efficient fptas for the 0-1 multi-objective knapsack problem

European Journal of Operational Research

Volumn 198, Issue 1, 2009, Pages 47-56

  Bazgan, Cristina ^a   Hugot, Hadrien ^a   Vanderpooten, Daniel ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Approximation; Combinatorial optimization; Dominance relations; Dynamic programming; Multi objective knapsack problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; NUMERICAL METHODS; POLYNOMIAL APPROXIMATION;

APPROXIMATION; CPU TIME; DOMINANCE RELATION; EXACT METHODS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; KNAPSACK PROBLEMS; MULTI OBJECTIVE; NUMERICAL EXPERIMENTS;

DYNAMIC PROGRAMMING;

EID: 62549134941     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.07.047     Document Type: Article

References (15)

1. Angel E., Bampis E., and Kononov A. On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theoretical Computer Science 306 1-3 (2003) 319-338
2. Bazgan C., Hugot H., and Vanderpooten D. Solving efficiently the 0-1 multi-objective knapsack problem. Computers and Operations Research 36 1 (2009) 260-279
3. Captivo M.E., Climaco J., Figueira J., Martins E., and Santos J.L. Solving bicriteria 0-1 knapsack problems using a labeling algorithm. Computers and Operations Research 30 12 (2003) 1865-1886
4. Ehrgott M. Multicriteria Optimization (2005), Springer, Berlin
5. Erlebach T., Kellerer H., and Pferschy U. Approximating multiobjective knapsack problems. Management Science 48 12 (2002) 1603-1612
6. Kellerer H., Pferschy U., and Pisinger D. Knapsack Problems (2004), Springer, Berlin
7. Klamroth K., and Wiecek M. Dynamic programming approaches to the multiple criteria knapsack problem. Naval Research Logistics 47 1 (2000) 57-76
8. Martello S., and Toth P. Knapsack Problems (1990), Wiley, New York
9. Nemhauser G., and Ullmann Z. Discrete dynamic programming and capital allocation. Management Science 15 9 (1969) 494-505
10. Papadimitriou, C.H., Yannakakis, M., 2000. On the approximability of trade-offs and optimal access of web sources. In: IEEE Symposium on Foundations of Computer Science (FOCS 2000), Redondo Beach, California, pp. 86-92.
11. Safer, H.M., Orlin, J.B., 1995a. Fast approximation schemes for multi-criteria combinatorial optimization. Working Paper 3756-95, Sloan School of Management, Massachusetts Institute of Technology.
12. Safer, H.M., Orlin, J.B., 1995b. Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems. Working Paper 3757-95, Sloan School of Management, Massachusetts Institute of Technology.
13. Serafini P. Some considerations about computational complexity for multiobjective combinatorial problems. In: Jahn J., and Krabs W. (Eds). Recent Advances and Historical Development of Vector Optimization. LNEMS vol. 294 (1986), Springer-Verlag, Berlin 222-232
14. Warburton A. Approximation of Pareto optima in multiple-objective, shortest-path problems. Operations Research 35 1 (1987) 70-79
15. Weingartner H., and Ness D. Methods for the solution of the multi-dimensional 0/1 knapsack problem. Operations Research 15 1 (1967) 83-103