No abstract

We slightly improve the pruning technique presented in Dantsin et al. (Theoret. Comput. Sci. 289 (2002) 69) to obtain an O * (1.473 n ) deterministic algorithm for 3-SAT.

We slightly improve the pruning technique presented in Dantsin et. al. (2002) to obtain an O * (1.473 n ) algorithm for 3-SAT.

In this paper, the problem of minimizing the total completion time on a single machine with the presence of release dates is studied. We introduce two different approaches leading to very large-scale neighborhoods in which the best improving neighbor can be determined in polynomial time. Furthermore, computational results are presented to get insight in the performance of the developed neighborhoods.

No abstract