Pages that link to "Item:Q2001201"

The following pages link to Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201):

Displaying 5 items.

• Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
• An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
• Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)