Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items
Year of publication: |
2023
|
---|---|
Authors: | Lalou, Mohammed ; Kheddouci, Hamamache |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 158.2023, p. 1-13
|
Subject: | Complexity | Constrained knapsack problem | Directed acyclic graphs | Dynamic programming | In-trees | Out-trees | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Dynamische Optimierung |
-
Algorithms and complexity analysis for robust single-machine scheduling problems
Tadayon, Bita, (2015)
-
A dynamic programming heuristic for the quadratic knapsack problem
Fomeni, Franklin Djeumou, (2014)
-
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
Fomeni, Franklin Djeumou, (2021)
- More ...
-
Business process graph matching based on vectorial signatures
Kacimi, Farid, (2019)
-
Weighted graph-based methods for identifying the most influential actors in trust social networks
Chekkai, Nassira, (2013)
- More ...