Standard Pairs and Group Relaxations in Integer Programming

@inproceedings{UniversityFairfax1998StandardPA,
  title={Standard Pairs and Group Relaxations in Integer Programming},
  author={DepartmentGeorge Mason UniversityFairfax},
  year={1998}
}
  • DepartmentGeorge Mason UniversityFairfax
  • Published 1998
The main result of this paper is a non-Buchberger algorithm for constructing initial ideals and Grr obner bases of toric ideals, based on the connections between toric ideals and integer programming. The tools used are those of standard pair decompositions of standard monomials of a toric initial ideal, localizations of such ideals at their associated primes and group relaxations of integer programs. We give an algorithm for constructing standard pair decompositions, provide degree bounds for… CONTINUE READING