Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem

Computational Optimization and Applications

Volumn 56, Issue 1, 2013, Pages 97-111

  Figueira, José Rui ^a   Paquete, Luís ^b   Simões, Marco ^b   Vanderpooten, Daniel ^c  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b UNIVERSITY OF COIMBRA   (Portugal)

^c UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Bi objective 0 1 knapsack problems; Bi objective simplex algorithm; Bounds sets; Dichotomic search; Multi objective combinatorial optimization

Indexed keywords

0-1 KNAPSACK PROBLEM; BOUNDS SETS; DICHOTOMIC SEARCH; MULTIOBJECTIVE COMBINATORIAL OPTIMIZATION; SIMPLEX ALGORITHM;

BENCHMARKING; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING;

ALGORITHMS;

EID: 84880253329     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-013-9551-x     Document Type: Article

References (21)

1. Aneja, Y.; Nair, K.: Bicriteria transportation problem. Manag. Sci. 25(1), 73-78 (1979)
2. Bazgan, C.; Hugot, H.; Vanderpooten, D.: Implementing an efficient fptas for the 0-1 multi-objective knapsack problem. Eur. J. Oper. Res. 198(1), 47-56 (2009)
3. Bazgan, C.; Hugot, H.; Vanderpooten, D.: Solving efficiently the 0-1 multi-objective knapsack problem. Comput. Oper. Res. 36(1), 260-279 (2009)
4. Captivo, M.; Clímaco, J.; Figueira, J.; Martins, E.; dos Santos, J.: Solving bicriteria 0-1 knapsack problems using a labeling algorithm. Comput. Oper. Res. 30(12), 1865-1886 (2003) (Pubitemid 36893357)
5. Cormen, T.; Leiserson, C.; Rivest, R.; Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
6. Erlebach, T.; Kellerer, H.; Pferschy, U.: Approximating multi-objective knapsack problems. Manag. Sci. 48(12), 1603-1612 (2002)
7. Gomes da Silva, C.; Clímaco, J.; Figueira, J.: A scatter search method for bi-criteria {0,1}-knapsack problems. Eur. J. Oper. Res. 169(2), 373-391 (2006) (Pubitemid 41375697)
8. Gomes da Silva, C.; Clímaco, J.; Figueira, J.: Core problems in bi-criteria {0, 1}-knapsack problems. Comput. Oper. Res. 35(7), 2292-2306 (2008) (Pubitemid 350167493)
9. Gomes da Silva, C.; Figueira, J.; Clímaco, J.: Integrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems. Eur. J. Oper. Res. 177(3), 1656-1677 (2007) (Pubitemid 44794349)
10. Jenkins, L.: A bicriteria knapsack program for planning remediation of contaminated lightstation sites. Eur. J. Oper. Res. 140(2), 427-433 (2002) (Pubitemid 34435043)
11. Klamroth, K.; Wiecek, M.M.: Dynamic programming approaches to the multiple criteria knapsack problem. Nav. Res. Logist. 47(1), 57-76 (2000) (Pubitemid 30542457)
12. Kellerer, H.; Pferschy, U.; Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)
13. Kostreva, M.; Ogryczak, W.; Tonkyn, D.: Relocation problems arising in conservation biology. Comput. Math. Appl. 37(4-5), 135-150 (1999)
14. Ehrgott, M.; Gandibleux, X.: Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34(9), 2674-2694 (2007) (Pubitemid 46176399)
15. Martello, S.; Toth, P.: Knapsack Problems - Algorithms and Computer Implementations. Wiley, New York (1990)
16. Nemhauser, G.; Ullmann, Z.: Discrete dynamic programming and capital allocation. Manag. Sci. 15(9), 494-505 (1969)
17. Pisinger, D.: A minimal algorithm for the 0-1 knapsack problem. Oper. Res. 45, 758-767 (1997) (Pubitemid 127684747)
18. Rosenblatt, M.; Sinuany-Stern, Z.: Generating the discrete efficient fronteir to the capital budgeting problem. Oper. Res. 37(3), 384-394 (1989)
19. Steuer, R.: Multiple Criteria Optimization: Theory, Computation and Application. Wiley, New York (1986)
20. Teng, J.; Tzeng, G.: A multiobjective programming approach for selecting non-independent transportation investiment alternatives. Transp. Res.; Part B, Methodol. 30(4), 201-307 (1996) (Pubitemid 126394596)
21. Visée, M.; Teghem, J.; Pirlot, M.; Ulungu, E.L.: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. J. Glob. Optim. 12(2), 139-155 (1998) (Pubitemid 128507670)