Pages that link to "Item:Q5949903"
From MaRDI portal
The following pages link to A polynomially solvable special case of the unbounded knapsack problem (Q5949903):
Displayed 6 items.
- Unbounded knapsack problems with arithmetic weight sequences (Q545110) (← links)
- A new lower bound for the linear knapsack problem with general integer variables (Q859686) (← links)
- A constructive periodicity bound for the unbounded knapsack problem (Q1758270) (← links)
- A well-solvable special case of the bounded knapsack problem (Q2275577) (← links)
- The skiving stock problem as a counterpart of the cutting stock problem (Q4814101) (← links)
- The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions (Q5870521) (← links)