Pages that link to "Item:Q1013302"
From MaRDI portal
The following pages link to A hybrid algorithm for the unbounded knapsack problem (Q1013302):
Displaying 12 items.
- Tight bounds for periodicity theorems on the unbounded knapsack problem (Q421659) (← links)
- A hybrid algorithm for the unbounded knapsack problem (Q1013302) (← links)
- A note on the max-min 0-1 knapsack problem (Q1304387) (← links)
- Unbounded knapsack problem: Dynamic programming revisited (Q1569945) (← links)
- An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169) (← links)
- Bridging game theory and the knapsack problem: a theoretical formulation (Q1990251) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074) (← links)
- Hybrid rounding techniques for knapsack problems (Q2489957) (← links)
- A Minimal Algorithm for the Bounded Knapsack Problem (Q4427321) (← links)
- An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem (Q4661050) (← links)
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems (Q5870449) (← links)