Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance (Q1327604)
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 591420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance |
scientific article; zbMATH DE number 591420 |
Statements
Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance (English)
0 references
10 October 1994
0 references
achievable space
0 references
multiclass queueing networks
0 references
scheduling policies
0 references
optimizing
0 references
tightness
0 references
linear programming problem
0 references
techniques from semidefinite programming
0 references
0.871269702911377
0 references
0.871269702911377
0 references
0.8661225438117981
0 references
0.809178352355957
0 references
0.8071268200874329
0 references
