Pages that link to "Item:Q2050272"
From MaRDI portal
The following pages link to Subset sum problems with special digraph constraints (Q2050272):
Displaying 5 items.
- Subset sum problems with digraph constraints (Q1631654) (← links)
- The knapsack problem with special neighbor constraints (Q2123119) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)