A service system with packing constraints: greedy randomized algorithm achieving sublinear in scale optimality gap (Q5084484)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A service system with packing constraints: greedy randomized algorithm achieving sublinear in scale optimality gap |
scientific article; zbMATH DE number 7547868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A service system with packing constraints: greedy randomized algorithm achieving sublinear in scale optimality gap |
scientific article; zbMATH DE number 7547868 |
Statements
A Service System with Packing Constraints: Greedy Randomized Algorithm Achieving Sublinear in Scale Optimality Gap (English)
0 references
24 June 2022
0 references
queueing networks
0 references
stochastic bin packing
0 references
packing constraints
0 references
greedy random (GRAND) algorithm
0 references
cloud computing
0 references
sublinear optimality gap
0 references
0 references
0 references
0.9343851208686828
0 references
0.881314218044281
0 references
0.8439593315124512
0 references
0.7259783148765564
0 references
0.7212565541267395
0 references
