|
Theory of main algorithms implemented
|
- graver
- R. Hemmecke. On the Positive Sum Property and the Computation of
Graver test sets. Mathematical Programming, 96(2):247--269.
- R. Hemmecke. Exploiting Symmetries in the Computation of Graver
Bases. e-print arXiv:math.CO/0410334, 2004.
- groebner / markov
- A.M. Bigatti and R. LaScala and L. Robbiano. Computing toric
ideals. Journal of Symbolic Computation 27 (1999), 351--365.
- R. Gebauer and H. M. Möller. On an installation of
Buchberger's algorithm. Journal of Symbolic Computation 6 (1988),
275--286.
- R. Hemmecke and P. Malkin. Computing generating sets of lattice
ideals. e-print arXiv:math.CO/0508359, 2005.
- S. Hosten and B. Sturmfels. GRIN: An implementation of
Gröbner bases for integer program- ming. In: "Integer
programming and combinatorial optimisation", E. Balas and
J. Clausen, eds., LNCS 920, Springer-Verlag, 1995, 267--276.
- P. Malkin. Truncated Markov bases and Gröbner bases for
Integer Programming. e-print arXiv:math.OC/0612615, 2006.
- hilbert
- R. Hemmecke. On the Computation of Hilbert Bases of Cones.
in: "Mathematical Software, ICMS 2002", A. M. Cohen, X.-S. Gao,
N. Takayama, eds., World Scientific, 2002.