Unloading of congestion in deterministic queueing networks
DOI10.1002/oca.4660020104zbMath0457.90030MaRDI QIDQ3907384
Publication date: 1981
Published in: Optimal Control Applications and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/oca.4660020104
uniqueness; existence of optimal solutions; Pontryagin maximum principle; optimal routing; optimal flow pattern; control procedure; deterministic queueing networks; topological optimization algorithm; unloading of congestion
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
90B10: Deterministic network models in operations research
Related Items
Cites Work