Pages that link to "Item:Q1631654"
From MaRDI portal
The following pages link to Subset sum problems with digraph constraints (Q1631654):
Displaying 6 items.
- The knapsack problem with special neighbor constraints (Q2123119) (← links)
- Envy-free allocations respecting social networks (Q2124438) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
