GRIN

swMATH8940MaRDI QIDQ20936FDOQ20936

Author name not available (Why is that?)

Cited In (31)

• Title not available (Why is that?)
• Moduli of McKay quiver representations I: the coherent component
• The multiparametric 0-1-integer linear programming problem: A unified approach
• Title not available (Why is that?)
• Ideals and graphs, Gröbner bases and decision procedures in graphs
• A study of a family of monomial ideals
• Test sets of integer programs
• Computing generating sets of lattice ideals and Markov bases of lattices
• A Variant of the Buchberger Algorithm for Integer Programming
• Truncated Gröbner bases for integer programming
• The 24-cell and Calabi-Yau threefolds with Hodge numbers \((1,1)\)
• Minimal resolutions of lattice ideals and integer linear programming
• An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
• FIRST SYZYGIES OF TORIC VARIETIES AND DIOPHANTINE EQUATIONS IN CONGRUENCE
• Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
• \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\)
• GRIN: An implementation of Gröbner bases for integer programming
• Universal Gröbner basis associated with the maximum flow problem
• Binomial fibers and indispensable binomials
• Title not available (Why is that?)
• Decompositions of binomial ideals
• Title not available (Why is that?)
• Variation of cost functions in integer programming
• Moduli of McKay quiver representations. II: Gröbner basis techniques
• Primary decomposition of lattice basis ideals
• Partial Gröbner Bases for Multiobjective Integer Linear Optimization
• Reconstructing biochemical cluster networks
• The regularity of a toric variety
• The circuit ideal of a vector configuration
• Minimal generating sets of lattice ideals
• GENERALIZED REDUCTION TO COMPUTE TORIC IDEALS

This page was built for software: GRIN