Copyright | (c) Pablo Couto 2014 |
---|---|
License | GPL-3 |
Maintainer | pablo@infty.in |
Stability | experimental |
Safe Haskell | None |
Language | Haskell2010 |
This module reexports some functions from Referees.Solver.Internal.
- mkProfitMatrix :: ProfitFunction a b c -> [a] -> [b] -> Maybe c -> ProfitMatrix
- run_lpGAP :: ProfitMatrix -> [Capacity] -> Bounds Copies -> IO (ReturnCode, Maybe (Double, Map String Double))
- fromGLPKtoList :: (ReturnCode, Maybe (Double, Map String Double)) -> Maybe [(Col, Row)]
Constructors
:: ProfitFunction a b c | |
-> [a] | Items |
-> [b] | Bins |
-> Maybe c | Optional quality |
-> ProfitMatrix |
Given a ProfitFunction
, mkProfitMatrix
computes a profit matrix between
bins
and items
, optionally taking a quality
as being by default shared
between them. The values in a ProfitMatrix
serve to distribute items among
bins according to the capacities of the latter and the values of the former.
Runners and helpers
run_lpGAP :: ProfitMatrix -> [Capacity] -> Bounds Copies -> IO (ReturnCode, Maybe (Double, Map String Double)) Source
fromGLPKtoList :: (ReturnCode, Maybe (Double, Map String Double)) -> Maybe [(Col, Row)] Source
fromGLPKtoList
turns the (unIOd) output of run_lpGAP
into a more usable
format.