| Title | GRIN: An Implementatiion of Groebner Bases for Integer Programming |
| Author(s) | Serkan Hosten, Bernd Sturmfels |
| Type | Article in Conference Proceedings |
| Abstract | In 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. |
| ISBN | 3-540-59408-6 |
| Language | English |
| Journal | Lectures Notes in Computer Science |
| Volume | 920 |
| Pages | 267 - 276 |
| Year | 1995 |
| Edition | 0 |
| Translation |
No |
| Refereed |
No |
| Conferencename | 4th International IPCO Conference on Integer Programming and Combinatorial Optimization |
