GRIN: An implementation of Gröbner bases for integer programming

DOI10.1007/3-540-59408-6_57OpenAlexW1498414621MaRDI QIDQ5101421

Serkan Hoşten, Bernd Sturmfels

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_57

zbMATH Keywords

integer programscommutative algebraCPLEXGr\(\ddot{o}\)bner bases

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

A study of a family of monomial ideals, Computing generating sets of lattice ideals and Markov bases of lattices, The 24-cell and Calabi-Yau threefolds with Hodge numbers \((1,1)\), Minimal generating sets of lattice ideals, The circuit ideal of a vector configuration, Binomial fibers and indispensable binomials, Moduli of McKay quiver representations. II: Gröbner basis techniques, Ideals and graphs, Gröbner bases and decision procedures in graphs, The regularity of a toric variety, \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\), The multiparametric 0-1-integer linear programming problem: A unified approach

Uses Software

• Macaulay2
• GRIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On an installation of Buchberger's algorithm
• Variation of cost functions in integer programming
• Algebraic algorithms for sampling from conditional distributions
• Gröbner bases of lattices, corner polyhedra, and integer programming
• An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
• Neighborhood Systems for Production Sets with Indivisibilities
• Minimal solutions of linear diophantine systems : bounds and algorithms