Pages that link to "Item:Q987829"
From MaRDI portal
The following pages link to A polynomial algorithm for the multiple knapsack problem with divisible item sizes (Q987829):
Displaying 6 items.
- Bin packing with divisible item sizes and rejection penalties (Q2136894) (← links)
- A new upper bound for the multiple knapsack problem (Q2668625) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
- Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties (Q6046629) (← links)
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines (Q6049692) (← links)
- When greedy gives optimal: a unified approach (Q6122087) (← links)
