Numeric.Limp.Solve.Branch.Simple

The simplest, stupidest possible branch and bound algorithm.

Documentation

branch :: (Ord z, Ord r, Rep c) => (Program z r c -> Maybe (Assignment () (Either z r) c, R c)) -> Program z r c -> Maybe (Assignment z r c, R c)

makeIntegral :: (Ord z, Ord r, Rep c) => Assignment () (Either z r) c -> Either (z, R c) (Assignment z r c)