Computing Truncated Grobner Bases for Integer Programming by Change of Ordering

摘要

In this paper, we introduce an algorithm to compute truncated Grobner bases for integer programming, that can be used as same as the reduced Grobner basis in Conti-Traverso algorithm for integer programming. Our algorithm does not use the Buchberger algorithm, which is known to be an extremely time-consuming procedure. Instead, we use the Grobner basis conversion techniques.