Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width

DOI10.1007/s00186-019-00664-yzbMath1416.05268MaRDI QIDQ2311126

Frank Gurski, Carolin Rehs

Publication date: 10 July 2019

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-019-00664-y

zbMATH Keywords

knapsack problem; clique-width; conflict graph; forcing graph

Mathematics Subject Classification ID

90C27: Combinatorial optimization

90C39: Dynamic programming

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)