Truncated Gröbner bases for integer programming

DOI10.1007/s002000050062zbMath0914.90203OpenAlexW2135307914WikidataQ114852529 ScholiaQ114852529MaRDI QIDQ1361003

Rekha R. Thomas, Robert Weismantel

Publication date: 1 June 1999

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050062

zbMATH Keywords

integer programmingtoric idealmultivariate gradingtruncated Buchberger algorithmtruncated Gröbner bases

Mathematics Subject Classification ID

Integer programming (90C10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, Non-standard approaches to integer programming, The combinatorics of modeling and analyzing biological systems, An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets, Test sets of integer programs

Uses Software

• GRIN