Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7075666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation |
scientific article; zbMATH DE number 7075666 |
Statements
Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (English)
0 references
2 July 2019
0 references
cutting and packing
0 references
server consolidation
0 references
normal distribution
0 references
nondeterministic item lengths
0 references
integer programming
0 references
HAEC
0 references
0 references
0 references
0 references
0.7733945250511169
0 references
0.7728014588356018
0 references
0.7666285037994385
0 references
0.7628905773162842
0 references
0.7596849799156189
0 references
