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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research Jg. 158; S. 106281
Hauptverfasser:	Lalou, Mohammed, Kheddouci, Hamamache
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.10.2023 Elsevier
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!