Standard pairs and group relaxations in integer programming (Q1295785)

By using the connections between toric ideals and integer programming, the authors give a non-Buchberger algorithm for constructing initial ideals and Gröbner bases of toric ideals. The main tools in giving such an algorithm are standard pair decompositions of standard monomials of a toric initial ideal, localization of such ideals at their associated primes and group relaxations of integer programs. An algorithm is also given for constructing standard pair decompositions. The special case of toric ideals of codimension two is considered, and new results are given on localization of the initial ideals of these ideals at their associated primes.