Dynamic programming based algorithms for the discounted {0-1} knapsack problem

@article{Rong2012DynamicPB,
  title={Dynamic programming based algorithms for the discounted \{0-1\} knapsack problem},
  author={Aiying Rong and Jos{\'e} Rui Figueira and Kathrin Klamroth},
  journal={Applied Mathematics and Computation},
  year={2012},
  volume={218},
  pages={6921-6933}
}
The discounted {0–1} knapsack problem (DKP) is an extension of the classical {0–1} knapsack problem (KP) that consists of selecting a set of item groups where each group includes three items and at most one of the three items can be selected. The DKP is more challenging than the KP because four choices of items in an item group diversify the selection of the items. Consequently, it is not possible to solve the DKP based on a classical definition of a core consisting of a small number of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

Application of differential evolution algorithm for solving discounted {0–1} knapsack problem

2017 IEEE 2nd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC) • 2017
View 1 Excerpt

Grey Wolf Optimization Applied to the 0 / 1 Knapsack Problem

Eman Yassien, Jordan Raja Masadeh, Jordan Abdullah Alzaqebah
2017

Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem

Seyedeh Fatemeh Razavia, Hedieh Sajedib
2015
View 1 Excerpt

New upper bounds and exact methods for the knapsack sharing problem

Applied Mathematics and Computation • 2014
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Where are the hard knapsack problems?

Computers & OR • 2005
View 5 Excerpts
Highly Influenced

J

M. E. Captivo
Clı́maco, J. Figueira, E. Martins, J.L. Santos, Solving bicriteria 0–1 knapsack problems using a labeling algorithm, Comput. Oper. Res. 30 • 2003
View 4 Excerpts
Highly Influenced

Dynamic programming.

Science • 1966
View 4 Excerpts
Highly Influenced

Guldan , Heuristic and exact algorithms for discounted knapsack problems

B.
2007

Heuristic and exact algorithms for discounted knapsack problems

B. Guldan
Master thesis, University of Erlangen–Nürnberg, Germany • 2007
View 3 Excerpts

Similar Papers

Loading similar papers…