A dynamic programming method with lists for the knapsack sharing problem

Authors:
V. Boyer;D. El Baz;M. Elkihel
Affiliations:
CNRS, LAAS, 7 avenue du Colonel Roche, F-31077 Toulouse, France and Université de Toulouse, UPS, INSA, INP, ISAE, LAAS, F-31077 Toulouse, France;CNRS, LAAS, 7 avenue du Colonel Roche, F-31077 Toulouse, France and Université de Toulouse, UPS, INSA, INP, ISAE, LAAS, F-31077 Toulouse, France;CNRS, LAAS, 7 avenue du Colonel Roche, F-31077 Toulouse, France and Université de Toulouse, UPS, INSA, INP, ISAE, LAAS, F-31077 Toulouse, France
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 7
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Solving knapsack sharing problems with general tradeoff functions

Mathematical Programming: Series A and B
Bounded knapsack sharing

Mathematical Programming: Series A and B
Heuristic and reduction algorithms for the knapsack sharing problem

Computers and Operations Research
An exact algorithm for the knapsack sharing problem

Computers and Operations Research
Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0--1 knapsack problem

Journal of Parallel and Distributed Computing

Solving knapsack problems on GPU

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.