Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items

We consider a new variant of the Knapsack Problem with dependencies between items. In this variant, the set of items is partitioned into subsets with dependencies among them, and an item can be selected from a subset only if at least one item is selected from each of its dependent subsets. We develo...

Celý popis

Podrobná bibliografia

Vydané v:	Computers & operations research Ročník 158; s. 106281
Hlavní autori:	Lalou, Mohammed, Kheddouci, Hamamache
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.10.2023 Elsevier
Predmet:	Complexity Computer Science Constrained knapsack problem Directed acyclic graphs Dynamic programming In-trees Out-trees Constrained knapsack problem In-trees Out-trees Dynamic programming Directed acyclic graphs Complexity
ISSN:	0305-0548, 1873-765X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!