Now showing items 1-2 of 2
The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2011)
We consider the network loading problem (NLP) under a polyhedral uncertainty description of traffic demands. After giving a compact multicommodity flow formulation of the problem, we state a decomposition property obtained ...
OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
We study the best OSPF style routing problem in telecommunication networks, where weight management is employed to get a routing configuration with the minimum oblivious ratio. We consider polyhedral demand uncertainty: ...