A dynamic programming method with lists for the knapsack sharing problem

In this paper, we propose a method to solve exactly the knapsack sharing problem (KSP) by using dynamic programming. The original problem (KSP) is decomposed into a set of knapsack problems. Our method is tested on correlated and uncorrelated instances from the literature. Computational results show that our method is able to find an optimal solution of large instances within reasonable computing time and low memory occupancy.

[1]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[2]  J. Randall Brown,et al.  Bounded knapsack sharing , 1994, Math. Program..

[3]  Hiroshi Konno,et al.  A linear-time algorithm for solving continuous maximin knapsack problems , 1991, Oper. Res. Lett..

[4]  Pamela H. Vance,et al.  Knapsack Problems: Algorithms and Computer Implementations (S. Martello and P. Toth) , 1993, SIAM Rev..

[5]  Takeo Yamada,et al.  Heuristic and reduction algorithms for the knapsack sharing problem , 1997, Comput. Oper. Res..

[6]  Mhand Hifi,et al.  The Knapsack Sharing Problem: An Exact Algorithm , 2002, J. Comb. Optim..

[7]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[8]  Didier El Baz,et al.  Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem , 2005, J. Parallel Distributed Comput..

[9]  J. Randall Brown,et al.  The Knapsack Sharing Problem , 1979, Oper. Res..

[10]  Didier El Baz,et al.  Heuristics for the 0-1 multidimensional knapsack problem , 2009, Eur. J. Oper. Res..

[11]  Takeo Yamada,et al.  Some exact algorithms for the knapsack sharing problem , 1998, Eur. J. Oper. Res..

[12]  Didier El Baz,et al.  Solution of multidimensional knapsack problems via cooperation of dynamic programming and branch and bound , 2010 .

[13]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[14]  J. Randall Brown.  Solving knapsack sharing problems with general tradeoff functions , 1991, Math. Program..

[15]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[16]  S. Martello,et al.  An upper bound for the zero-one knapsack problem and a branch and bound algorithm , 1977 .

[17]  Mhand Hifi,et al.  An exact algorithm for the knapsack sharing problem , 2005, Comput. Oper. Res..