Faaland, Bruce; Kim, Kiseog; Schmitt, Tom - In: Management Science 36 (1990) 3, pp. 315-331
A closure in a directed graph is a subset of nodes, all of whose successors belong to the subset. If each node has an assigned weight, which may be positive or negative, the maximal closure problem is one of finding a closure with the largest possible sum of node weights. It can be solved by any...