In this paper, we consider a robust combinatorial optimization problem with uncertain weights and propose an uncertainty set that generalizes interval by imposing lower upper bounds on deviations of subsets items. We prove if the number such is fixed family these laminar, then can be solved solving nominal problems. This result previous similar for case where partition