There is also LattE for enumerating integral points in a convex polytope: http://www.math.ucdavis.edu/~latte/
I need to efficiently find lattice points in a parallelopiped (of arbitrary dimension) with potentially half-integer vertex points (including some facets but not others), which would fit under this heading. I have plans for a nice fix for my specific problem based on suggestions by M. Koeppe, but wouldn't mind seeing the functionality of Polytope() and LatticePolyhedron() extended. Eva Curry On Jun 8, 5:04 pm, Robert Schwarz <m...@rschwarz.net> wrote: > On 06/08/2010 07:50 PM, Volker Braun wrote: > > > Can PPL find integral points in polyhedra with not necessarily > > integral vertices (mixed integer programming)? I'm somewhat familiar > > with the library but I don't see how to do that. Code sample? -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
