Subset sum problems with special digraph constraints

DOI10.1007/978-3-030-48439-2_41zbMath1476.90281OpenAlexW3088600614MaRDI QIDQ2050272

Frank Gurski, Carolin Rehs, Dominique Komander

Publication date: 30 August 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-48439-2_41

zbMATH Keywords

subset sum problemdirected co-graphsseries-parallel digraphsdigraph constraint

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

The knapsack problem with special neighbor constraints ⋮ Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items ⋮ How to compute digraph width measures on directed co-graphs

This page was built for publication: Subset sum problems with special digraph constraints