Pages that link to "Item:Q3625691"
From MaRDI portal
The following pages link to A note on dual approximation algorithms for class constrained bin packing problems (Q3625691):
Displaying 6 items.
- The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
- Approximation schemes for knapsack problems with shelf divisions (Q818116) (← links)
- An exact algorithm for the dual bin packing problem (Q1892657) (← links)
- A one-dimensional bin packing problem with shelf divisions (Q2482104) (← links)
- On a dual version of the one-dimensional bin packing problem (Q3219761) (← links)
- Non-preemptive Scheduling on Machines with Setup Times (Q3449852) (← links)