The Knapsack Problem with Special Neighbor Constraints on Directed Co-graphs

Steffen Goebbels (), Frank Gurski () and Dominique Komander ()
Additional contact information
Steffen Goebbels: Niederrhein University of Applied Sciences
Frank Gurski: University of Düsseldorf
Dominique Komander: University of Düsseldorf

A chapter in Operations Research Proceedings 2021, 2022, pp 95-100 from Springer

Abstract: Abstract The knapsack problem is one of the best known and most fundamental NP-hard problems in combinatorial optimization. We consider two knapsack problems which contain additional constraints in the form of directed graphs whose vertex set corresponds to the item set. In the 1-neighbor knapsack problem, an item can be chosen only if at least one of its successors is chosen. In the all-neighbors knapsack problem, an item can be chosen only if all of its successors are chosen. For both problems, we consider uniform and general profits and weights. Since all these problems generalize the knapsack problem, they are NP-hard. This motivates us to consider the problem on special graph classes. Therefore, we restrict these problems to directed co-graphs, i.e., directed complement reducible graphs, that are precisely those digraphs which can be defined from the single vertex graph by applying the disjoint union, order and series composition. We show polynomial time solutions for the uniform problems on directed co-graphs and pseudo-polynomial time solutions for the general problems on directed co-graphs. These results improve known worst-case runtimes in comparison to constraints given by unrestricted digraphs.

Keywords: Knapsack problem; Neighbor constraints; Directed co-graphs (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-08623-6_15

Ordering information: This item can be ordered from
http://www.springer.com/9783031086236

DOI: 10.1007/978-3-031-08623-6_15

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().