Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Efficient solution of linear diophantine equations
Journal of Symbolic Computation
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Hard Equality Constrained Integer Knapsacks
Mathematics of Operations Research
Hi-index | 0.00 |
Let K be an arbitrary field and {d"1,...,d"n} a set of all-different positive integers. The aim of this work is to propose and evaluate an algorithm for checking whether or not the toric ideal of the affine monomial curve {(t^d^"^1,...,t^d^"^n)|t@?K}@?A"K^n is a complete intersection. The algorithm is based on new results regarding the toric ideal of the curve, and it can be seen as a generalization of the classical result of Herzog for n=3. Computational experiments show that the algorithm is able to solve large-size instances.