Regular decomposition in integer programming

DOI10.3770/J.ISSN:2095-2651.2018.02.009MaRDI QIDQ4688457zbMATH OpenFDO

Authors Han Wang, Chun-Gang Zhu

Publication date 22 October 2018

Full work available at URL https://doi.org/10.3770/J.ISSN:2095-2651.2018.02.009

zbMATH Keywords

binomial idealinteger programmingregular decompositionsstate polytopeuniversal Gröbner bases

Mathematics Subject Classification ID

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

Recommendations

• Regular Decompositions
• Integral decomposition of polyhedra and some applications in mixed integer programming
• Decomposition of integer programs and of generating sets
• Application of regular partitions in integer programming
• Gröbner bases of lattices, corner polyhedra, and integer programming

Cited in

(3)

• Regular Decompositions
• scientific article; zbMATH DE number 1216241 (Why is no real title available?)
• Properties of regular systems and algorithmic improvements for regular decomposition

This page was built for publication: Regular decomposition in integer programming

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