An algorithm for solving systems of linear diophantine equations in naturals (Q4366594)

This is an algorithm for finding the minimal solutions of \(Ax= 0\), \(A\) is an \(m\times n\) integer matrix, \(x\in\mathbb{N}^n\); minimality is defined with regard to componentwise ordering. Let \(C\) be the polyhedral convex cone of the nonnegative real solutions of \(Ax=0\). Then all faces of \(C\) (including \(C\)) are considered searching for minimal solutions lying in the interior of each face. This is done by a special enumeration method. Finally, by a simple argument, global minimal solutions can be found. For the entire collection see [Zbl 0878.00081].