Pages that link to "Item:Q2669539"
From MaRDI portal
The following pages link to Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539):
Displaying 6 items.
- The stochastic generalized bin packing problem (Q423955) (← links)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
- Using matrix approximation for high-dimensional discrete optimization problems: server consolidation based on cyclic time-series data (Q2253623) (← links)
- Cutting and packing problems under uncertainty: literature review and classification framework (Q6056892) (← links)
- A heuristic column generation approach for the stochastic bin packing problem (Q6606532) (← links)
