Consider an integer program max(ct x : Ax = b, x ≥ 0, x ∈ Zn ) where A ∈ Zm×n , b ∈ Zm , and c ∈ Zn . We show that the integer program can be solved in pseudo-polynomial...
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...