An application of the Hermite normal form in integer programming

DOI10.1016/0024-3795(90)90228-5zbMATH Open0722.90048OpenAlexW2062604685WikidataQ62638423 ScholiaQ62638423MaRDI QIDQ757241FDOQ757241

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

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

Cites Work

• Title not available (Why is that?)
• Hermite Normal Form Computation Using Modulo Determinant Arithmetic
• Title not available (Why is that?)
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

Cited In (3)

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

   Recommendations

• Résolution de programmes linéaires entiers ou mixtes à l'aide de la forme normale de Hermite 👍 👎
• Title not available (Why is that?) 👍 👎
• A simple finite cutting plane algorithm for integer programs 👍 👎
• The mixed cutting plane algorithm for all-integer programming 👍 👎
• Fenchel Cutting Planes for Integer Programs 👍 👎

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

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