1. Home
  2. Issues
  3. Volume 27, Issue 2 (2016)
  4. Dynamic-Programming-Based Inequalities f ...

Informatica


Cited by 3
Dynamic-Programming-Based Inequalities for the Unbounded Integer Knapsack Problem

2023 5th International Conference on Cybernetics and Intelligent System (ICORIS)
Mietha Anditta, Natashya Amartya, Laurens Spits Warnars, Harco Leslie Hendric Spits Warnars, Arief Ramadhan, Teddy Siswanto, Teddy Mantoro, Nurulhuda Noordin
https://doi.org/10.1109/ICORIS60118.2023.10352182
Conference:  (2023), p. 1
Knapsack problems — An overview of recent advances. Part I: Single knapsack problems
Valentina Cacchiani, Manuel Iori, Alberto Locatelli, Silvano Martello
https://doi.org/10.1016/j.cor.2021.105692
Journal:  Computers & Operations Research Volume 143 (2022), p. 105692
Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
Valentina Cacchiani, Manuel Iori, Alberto Locatelli, Silvano Martello
https://doi.org/10.1016/j.cor.2021.105693
Journal:  Computers & Operations Research Volume 143 (2022), p. 105693


Share


RSS