Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10288-018-0384-4 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129494472 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10288-018-0384-4 / rank | |||
Normal rank | |||
Latest revision as of 17:45, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation |
scientific article |
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
