Word Problem of the Perkins Semigroup via Directed Acyclic Graphs

A simulated annealing algorithm with the

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

✍ Taichi Kaji; Azuma Ohuchi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 240 KB

In this paper, we present an approach for ®nding a minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the precedence relationships among the elements are satis®ed, based on the concept of simulated annealing. Simulated anneali