The following pages link to (Q4149228):
Displaying 8 items.
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- A note on dominance relation in unbounded knapsack problems (Q1180824) (← links)
- Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem (Q1251184) (← links)
- An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169) (← links)
- A note on the Martello-Toth algorithm for one-dimensional knapsack problems (Q2265950) (← links)
- Algorithms for the bounded set-up knapsack problem (Q2467131) (← links)
- A minimal algorithm for the Bounded Knapsack Problem (Q5101408) (← links)
