Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal


TitleGRIN: An Implementatiion of Groebner Bases for Integer Programming
Author(s) Serkan Hosten, Bernd Sturmfels
TypeArticle in Conference Proceedings
AbstractIn this paper we present a computer program (GRIN) for solving and analyzing integer programs using Groebner bases. The algorithms coded in GRIN are drawn from both commutative algebra and the standard IP repertoire (e.g. Lovasz' reduced lattice bases). We present two new algorithms for computing generators of toric ideals. One of them is due to DiBiase and Urbanke [6]. The emphasis of our discussion lies on experiments and practical computability. A comparison to existing integer programming software (CPLEX) is given as well.
JournalLectures Notes in Computer Science
Pages267 - 276
Translation No
Refereed No
Conferencename4th International IPCO Conference on Integer Programming and Combinatorial Optimization