A Unified approach to linear programming bounds for queueing networks: Systems with polyhedral invariance of transition probabilities
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Morrison, James R | - |
| dc.contributor.author | Kumar, P. R. | - |
| dc.date.accessioned | 2013-03-16T23:40:04Z | - |
| dc.date.available | 2013-03-16T23:40:04Z | - |
| dc.date.created | 2012-06-20 | - |
| dc.date.issued | 2000-12 | - |
| dc.identifier.citation | IEEE Conference on Decision and Control, v., no., pp. - | - |
| dc.identifier.uri | http://hdl.handle.net/10203/137373 | - |
| dc.language | ENG | - |
| dc.publisher | IEEE | - |
| dc.title | A Unified approach to linear programming bounds for queueing networks: Systems with polyhedral invariance of transition probabilities | - |
| dc.type | Conference | - |
| dc.type.rims | CONF | - |
| dc.citation.publicationname | IEEE Conference on Decision and Control | - |
| dc.identifier.conferencecountry | Australia | - |
| dc.identifier.conferencecountry | Australia | - |
| dc.contributor.localauthor | Morrison, James R | - |
| dc.contributor.nonIdAuthor | Kumar, P. R. | - |
- Appears in Collection
- IE-Conference Papers(학술회의논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.