An application of the Hermite normal form in integer programming

DOI10.1016/0024-3795(90)90228-5zbMath0722.90048OpenAlexW2062604685WikidataQ62638423 ScholiaQ62638423MaRDI QIDQ757241

Walter O. Rom, Ming S. Hung

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0024-3795(90)90228-5

zbMATH Keywords

cutting planelinear integer programs

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Canonical forms, reductions, classification (15A21)

Related Items (3)

On random nonsingular Hermite normal form ⋮ A Formal Proof of the Computation of Hermite Normal Form in a General Setting ⋮ Totally tight Chvatal-Gomory cuts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hermite Normal Form Computation Using Modulo Determinant Arithmetic
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Equivalent Integer Programs and Canonical Problems
• Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations
• A Generalized Inverse Which Gives all the Integral Solutions to a System of Linear Equations
• A New Version of the Euclidean Algorith

This page was built for publication: An application of the Hermite normal form in integer programming