The knapsack problem with special neighbor constraints on directed co-graphs

DOI10.1007/978-3-031-08623-6_15MaRDI QIDQ6606640zbMATH OpenFDO

Authors Steffen J. Goebbels, Frank Gurski, Dominique Komander

Publication date 17 September 2024

zbMATH Keywords

knapsack problemdirected co-graphsneighbor constraints

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The knapsack problem with special neighbor constraints
• The knapsack problem with neighbour constraints
• The 1-Neighbour Knapsack Problem
• The Knapsack Problem with Conflict Graphs
• Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width

Cites work

• Fully dynamic recognition algorithm and certificate for directed cographs
• Solutions for subset sum problems with special digraph constraints
• Subset sum problems with digraph constraints
• The 1-Neighbour Knapsack Problem
• The Recognition of Series Parallel Digraphs
• The knapsack problem with neighbour constraints
• The knapsack problem with special neighbor constraints
• Upper bounds to the clique width of graphs

This page was built for publication: The knapsack problem with special neighbor constraints on directed co-graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606640)