Tell me more ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.

Is there a reasonably fast algorithm for solving systems of linear Diophantine inequalities?

share|improve this question

1 Answer

This research paper looks like something you'd like to read.

share|improve this answer
That's exactly what I'm looking for, except for one problem: They give the algorithm on pages 350-351, but part of step (3) appears to be missing. – Avi Steiner Jul 10 '11 at 5:12
Wow. Let me try to find the issue the algorithm came from, as that's pretty bad reviewing... – Blender Jul 10 '11 at 20:48
I'm not sure if you can view this PDF, but this paper seems to cover the same topics (solutions to the systems, but not for inequalities) so you might be able to find a use for it: springerlink.com/content/t8qa7gumcly3ua2m – Blender Jul 10 '11 at 20:54
That might be able to help. I'm going to try reposting this question on math overflow. Maybe somebody there will have an idea. – Avi Steiner Jul 10 '11 at 23:45
I bet they'll just write you a research paper ;) That place is pretty hardcore. – Blender Jul 10 '11 at 23:57
show 1 more comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.