1. Wang XZ, He YC (2017) A survey on evolutionary algorithms of solving knapsack problems. J Softw (Chinese) 281(1):1–16. doi: 10.13328/j.cnki.jos.005139
2. De Vries S, Vohra RV (2003) Combinatorial auctions: a survey. INFORMS J Comput 15(3):284–309
3. Kellerer H, Pferschy U, Pisinger D (2004) Introduction to NP-completeness of knapsack problems. Knapsack problems. Springer, Berlin Heidelberg, pp 483–493
4. Abdel-Basset M et al (2017) Solving 0–1 knapsack problems by binary dragonfly algorithm. In: International Conference on Intelligent Computing. Springer, Cham, pp 491–502
5. Kennedy J (2011) Particle swarm optimization. Encyclopedia of machine learning. Springer, US, pp 760–766