Pages that link to "Item:Q1875611"
From MaRDI portal
The following pages link to Computational aspects of hard knapsack problems. (Q1875611):
Displayed 4 items.
- Tight bounds for periodicity theorems on the unbounded knapsack problem (Q421659) (← links)
- A hybrid algorithm for the unbounded knapsack problem (Q1013302) (← links)
- A heuristic for the problem of one-dimensional steel coil cutting (Q1983859) (← links)
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems (Q5870449) (← links)