| Safe Haskell | None |
|---|---|
| Language | Haskell98 |
OBDD.Linopt
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. The set of keys of the weight map *must* be the full set of variables.