Pages that link to "Item:Q1932367"
From MaRDI portal
The following pages link to The knapsack problem with neighbour constraints (Q1932367):
Displayed 6 items.
- Subset sum problems with digraph constraints (Q1631654) (← links)
- The knapsack problem with special neighbor constraints (Q2123119) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
- Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)