A Variant of the Buchberger Algorithm for Integer Programming

DOI10.1137/S0895480195281209MaRDI QIDQ3128207zbMATH OpenFDO

Authors R. Urbaniak, Robert Weismantel, Günter M. Ziegler

Publication date 20 May 1997

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480195281209

zbMATH Keywords

\(S\)-pair reduction algorithmBuchberger algorithmGröbner basisiterative improvement heuristicstest setsupper bounds

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 1276818
• A Geometric Buchberger Algorithm for Integer Programming
• GRIN: an implementation of Gröbner bases for integer programming

Cited in

(15)

• Test sets of integer programs
• The height of minimal Hilbert bases
• Minimised geometric Buchberger algorithm for integer programming
• Generalized reduction to compute toric ideals
• Representing and solving finite-domain constraint problems using systems of polynomials
• scientific article; zbMATH DE number 177867 (Why is no real title available?)
• scientific article; zbMATH DE number 1254003 (Why is no real title available?)
• scientific article; zbMATH DE number 1736031 (Why is no real title available?)
• A Geometric Buchberger Algorithm for Integer Programming
• Algorithms and Computation
• The combinatorics of modeling and analyzing biological systems
• Augmentation search for integer programming over a polyhedron
• Non-standard approaches to integer programming
• Exploring the geometric buchberger algorithm in integer programming
• Integer programming with binary and bounded variables via Gröbner bases with applications to multiobjective integer programming

Describes a project that uses

Uses Software

• GRIN

This page was built for publication: A Variant of the Buchberger Algorithm for Integer Programming

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