[Haskell-cafe] Re: Finding points contained within a convex hull.

DavidA polyomino at f2s.com
Thu Jun 7 06:38:36 EDT 2007


It's been a while, but I believe that you can solve integer programming 
problems of this type using Groebner bases.
(Google for "integer programming with Groebner bases").

I have some Groebner basis code in Haskell at
http://www.polyomino.f2s.com/david/haskell/commalg.html



More information about the Haskell-Cafe mailing list