The following pages link to (Q3882189):
Displaying 15 items.
- A heuristic algorithm for the multidimensional zero-one knapsack problem (Q789318) (← links)
- Qos-aware service evaluation and selection (Q932236) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- An exact algorithm for the fixed-charge multiple knapsack problem (Q1011207) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- The knapsack problem with generalized upper bounds (Q1122484) (← links)
- An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
- An algorithm and efficient data structures for the binary knapsack problem (Q1255893) (← links)
- An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271) (← links)
- New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
- Tolerance analysis for 0-1 knapsack problems (Q1751719) (← links)
- A pegging approach to the precedence-constrained knapsack problem (Q2371351) (← links)
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
- A new variable reduction technique for convex integer quadratic programs (Q2472944) (← links)
- A minimal algorithm for the Bounded Knapsack Problem (Q5101408) (← links)
