A Variant of the Buchberger Algorithm for Integer Programming

DOI10.1137/S0895480195281209zbMath0872.90065MaRDI QIDQ3128207

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

Publication date: 20 May 1997

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

zbMATH Keywords

upper boundsGröbner basistest setsBuchberger algorithm\(S\)-pair reduction algorithmiterative improvement heuristics

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Representing and solving finite-domain constraint problems using systems of polynomials, The height of minimal Hilbert bases, GENERALIZED REDUCTION TO COMPUTE TORIC IDEALS, Non-standard approaches to integer programming, The combinatorics of modeling and analyzing biological systems, Test sets of integer programs

Uses Software

• GRIN