Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
linopt :: (Ord v, Num w, Ord w) => OBDD v -> Map v w -> Maybe (w, Map v Bool) Source #
solve the constrained linear optimisation problem: returns an assignment that is a model of the BDD and maximises the sum of weights of variables. Keys missing from the weight map, but present in the BDD, get weight zero.