5 Oct
2011
5 Oct
'11
11:06 a.m.
Hello Enea,
[...] I am afraid I don't have an answer to your question. As far as I can tell, unless some strong assumptions are made (e.g., fixed-and-low space dimension or fixed shape polyhedra), computing the integer hull of a rational polyhedron is really a tough problem.
Thanks for the quick answer. I suspected as much.
Do you know if it makes it easier that the polyhedron whose integer hull I want is obtained as the intersection between an "integer" polyhedron (it is its own integer hull) and a simple linear constraint?
Regards,
Didier