Truncated Gröbner bases for integer programming

DOI10.1007/S002000050062zbMATH Open0914.90203OpenAlexW2135307914WikidataQ114852529 ScholiaQ114852529MaRDI QIDQ1361003FDOQ1361003

Rekha 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

Recommendations

• GRIN: An implementation of Gröbner bases for integer programming
• [[:Publication:4394952|Title not available (Why is that?)]]
• [[:Publication:4238963|Title not available (Why is that?)]]

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)

Cited In (10)

• A comparison of algorithms for one class of totally regular truncations
• Non-standard approaches to integer programming
• Minimised geometric Buchberger algorithm for integer programming
• The combinatorics of modeling and analyzing biological systems
• Test sets of integer programs
• An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
• Title not available (Why is that?)
• An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• GRIN

This page was built for publication: Truncated Gröbner bases for integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361003)