A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs.

Taichi Kaji Azuma Ohuchi A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs. 147-157 1999 112 European Journal of Operational Research 1 http://dx.doi.org/10.1016/S0377-2217(97)00381-0 db/journals/eor/eor112.html#KajiO99