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

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 158; p. 106281
Main Authors:	Lalou, Mohammed, Kheddouci, Hamamache
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.10.2023 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!