Now showing items 1-3 of 3
The robust spanning tree problem with interval data
Motivated by telecommunications applications we investigate the minimum spanning tree problem where edge costs are interval numbers. Since minimum spanning trees depend on the realization of the edge costs, we de5ne the ...
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 ...
Restricted robust uniform matroid maximization under interval uncertainty
For the problem of selecting p items with interval objective function coefficients so as to maximize total profit, we introduce the r-restricted robust deviation criterion and seek solutions that minimize the r-restricted ...