A dynamic programming method with lists for the knapsack sharing problem

Computers and Industrial Engineering

Volumn 61, Issue 2, 2011, Pages 274-278

  Boyer, V ^a,b   El Baz, D ^a,b   Elkihel, M ^a,b  

^a LAAS CNRS   (France)

^b UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

Combinatorial optimization; Dynamic programming; Knapsack sharing problem; Max min programming

Indexed keywords

COMPUTATIONAL RESULTS; COMPUTING TIME; DYNAMIC PROGRAMMING METHODS; KNAPSACK PROBLEMS; KNAPSACK SHARING PROBLEM; LOW MEMORY; MAX-MIN; OPTIMAL SOLUTIONS;

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; OPTIMIZATION;

DYNAMIC PROGRAMMING;

EID: 80052437237     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2010.10.015     Document Type: Conference Paper

References (16)

1. R. Bellman Dynamic programming 1957 Princeton University Press Princeton, NJ
2. V. Boyer, D. El Baz, and M. Elkihel Heuristics for the 0-1 multidimensional knapsack problem European Journal of Operational Research 199 3 2009 658 664
3. V. Boyer, D. El Baz, and M. Elkihel Solution of multidimensional knapsack problems via cooperation of dynamic programming and branch and bound European Journal of Industrial Engineering 4 4 2010 434 449
4. J.R. Brown The knapsack sharing problem Operations Research 27 1979 341 355
5. J.R. Brown Solving knapsack sharing with general tradeoff functions Mathematical Programming 51 1991 55 73 (Pubitemid 21694476)
6. J.R. Brown Bounded knapsack sharing Mathematical Programming 67 1994 343 382
7. El Baz, D., Boyer, V. (2010). Library of instances for knapsack sharing problems. < http://www.laas.fr/CDA/23-31298-Knapsack-sharing-problems.php >.
8. D. El Baz, and M. Elkihel Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem Journal of Parallel and Distributed Computing 65 2005 74 84 (Pubitemid 40079243)
9. M. Hifi, H. M'Halla, and S. Sadfi An exact algorithm for the knapsack sharing problem Computers and Operations Research 32 2005 1311 1324
10. M. Hifi, and S. Sadfi The knapsack sharing problem: An exact algorithm Journal of Combinatorial Optimization 6 2002 35 54 (Pubitemid 34130062)
11. Hifi, M. Library of instances. (2005) < ftp://cermsem.univ-paris1.fr/ pub/CERMSEM/hifi/KSP >.
12. S. Martello, and P. Toth An upper bound for the zero-one knapsack problem and a branch and bound algorithm European Journal of Operations Research 1 1977 69 175
13. S. Martello, and P. Toth Knapsack problems: Algorithms and computer implementation 1990 John Wiley & Sons New York
14. G.L. Nemhauser, and L.A. Wolsey Integer and combinatorial optimization 1988 Wiley New York
15. T. Yamada, M. Futakawa, and S. Kataoka Heuristic and reduction algorithms for the knapsack sharing problem Computers and Operations Research 24 1997 961 967
16. T. Yamada, M. Futakawa, and S. Kataoka Some exact algorithms for the knapsack sharing problem European Journal of Operational Research 106 1998 177 183 (Pubitemid 128373572)