| Copyright | (c) Masahiro Sakai 2012 |
|---|---|
| License | BSD-style |
| Maintainer | masahiro.sakai@gmail.com |
| Stability | provisional |
| Portability | non-portable (ScopedTypeVariables, Rank2Types) |
| Safe Haskell | None |
| Language | Haskell2010 |
ToySolver.Arith.MIPSolver2
Description
Naïve implementation of MIP solver based on Simplex2 module
Reference:
- http://www.math.cuhk.edu.hk/~wei/lpch3.pdf
- Ralph E. Gomory. "An Algorithm for the Mixed Integer Problem", Technical Report RM-2597, 1960, The Rand Corporation, Santa Monica, CA. http://www.rand.org/pubs/research_memoranda/RM2597.html
- Ralph E. Gomory. "Outline of an algorithm for integer solutions to linear programs". Bull. Amer. Math. Soc., Vol. 64, No. 5. (1958), pp. 275-278. http://projecteuclid.org/euclid.bams/1183522679
- R. C. Daniel and Martyn Jeffreys. "Unboundedness in Integer and Discrete Programming L.P. Relaxations" The Journal of the Operational Research Society, Vol. 30, No. 12. (1979) http://www.jstor.org/stable/3009435
- data Solver
- newSolver :: Solver -> IntSet -> IO Solver
- optimize :: Solver -> IO OptResult
- getBestSolution :: Solver -> IO (Maybe (Model, Rational))
- getBestValue :: Solver -> IO (Maybe Rational)
- getBestModel :: Solver -> IO (Maybe Model)
- setNThread :: Solver -> Int -> IO ()
- setLogger :: Solver -> (String -> IO ()) -> IO ()
- setOnUpdateBestSolution :: Solver -> (Model -> Rational -> IO ()) -> IO ()
- setShowRational :: Solver -> Bool -> IO ()