Browsing by Subject "Interval data"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Restricted robust uniform matroid maximization under interval uncertainty
    (Springer, 2007) Yaman, H.; Karaşan, O. E.; Pınar, M. Ç.
    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 robust deviation. This new criterion increases the modeling power of the robust deviation (minmax regret) criterion by reducing the level of conservatism of the robust solution. It is shown that r-restricted robust deviation solutions can be computed efficiently. Results of experiments and comparisons with absolute robustness, robust deviation and restricted absolute robustness criteria are reported.
  • Thumbnail Image
    ItemOpen Access
    The robust spanning tree problem with interval data
    (Elsevier, 2001) Yaman, H.; Karaşan, O. E.; Pınar, M. Ç.
    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 robust spanning tree problem to hedge against the worst case contingency, and present a mixed integer programming formulation of the problem. We also de5ne some useful optimality concepts, and present characterizations for these entities leading to polynomial time recognition algorithms. These entities are then used to preprocess a given graph with interval data prior to the solution of the robust spanning tree problem. Computational results show that these preprocessing procedures are quite e9ective in reducing the time to compute a robust spanning tree.