In this paper, we consider a variant of adaptive robust combinatorial optimization problems where the decision maker can prepare K solutions and choose best among them upon knowledge true data realizations. We suppose that uncertainty may affect objective constraints through functions are not necessarily linear. propose new exact algorithm for solving these when feasible set nominal problem doe...

Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...

A distributed system is a software system in which components located on networked computers communicate and coordinate their actions by passing messages. Most of the existing solutions on task scheduling and resource management in distributed computing environment are based on the traditional client/ server model, enforcing a homogeneous policy on making decisions and limiting the flexibility,...