Pages that link to "Item:Q287072"

The following pages link to A polynomial-time algorithm for knapsack with divisible item sizes (Q287072):

Displaying 6 items.

• A polynomial algorithm for the multiple knapsack problem with divisible item sizes (Q987829) (← links)
• The complexity of multidimensional periodic scheduling (Q1281399) (← links)
• A well-solvable special case of the bounded knapsack problem (Q2275577) (← links)
• A new upper bound for the multiple knapsack problem (Q2668625) (← links)
• Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (Q6081604) (← links)
• When greedy gives optimal: a unified approach (Q6122087) (← links)