Pages that link to "Item:Q1076516"
From MaRDI portal
The following pages link to The complexity of the 0/1 multi-knapsack problem (Q1076516):
Displaying 8 items.
- On the computational complexity of the virtual network embedding problem (Q325446) (← links)
- Knapsack problems for NL (Q673615) (← links)
- Some computational results on real 0-1 knapsack problems (Q1079123) (← links)
- Comment on 'Some computational results on real 0-1 knapsack problems' (Q1089254) (← links)
- Adjacency of the 0-1 knapsack problem (Q1195107) (← links)
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
- On a communication complexity problem in combinatorial number theory (Q2077279) (← links)
- (Q5089171) (← links)