Decomposing finitely generated integral monoids by elimination

DOI10.1016/0024-3795(91)90220-QMaRDI QIDQ1175279zbMATH OpenFDO

Authors Jennifer K. Ryan

Publication date 25 June 1992

Published in Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

integral monoid

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• The structure of an integral monoid and integer programming feasibility
• Decomposition of integer programs and of generating sets
• scientific article; zbMATH DE number 1011070
• On finitely generated submonoids of \(\mathbb{N}^ k\)
• Integral decomposition of polyhedra and some applications in mixed integer programming

Cites work

• A new polynomial-time algorithm for linear programming
• An Abstract Linear Duality Model
• Fourier-Motzkin elimination extension to integer programming problems
• Hermite Normal Form Computation Using Modulo Determinant Arithmetic
• The value function of an integer program
• Weyl-minkowski duality for integarl monoids^*

Cited in

(5)

• Mixed-integer linear representability, disjunctions, and Chvátal functions -- modeling implications
• scientific article; zbMATH DE number 4125194 (Why is no real title available?)
• Decomposition of strongly separative monoids
• Decomposition of integer programs and of generating sets
• Integer programming as projection

This page was built for publication: Decomposing finitely generated integral monoids by elimination

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