Finding a partial solution to a linear system of equations in positive integers

DOI10.1016/0898-1221(88)90172-1zbMATH Open0649.65033OpenAlexW1993260645MaRDI QIDQ1105986FDOQ1105986

Authors: J. L. Lambert 

Publication date: 1988

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(88)90172-1

Recommendations

• scientific article; zbMATH DE number 1090094
• scientific article
• scientific article
• On polynomial-time solvable linear Diophantine problems
• Solving linear systems of equations over integers with Gröbner bases

zbMATH Keywords

algorithmlinear systempartial solutionspositive integer solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Direct numerical methods for linear systems and matrix inversion (65F05) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Algorithm for the General Petri Net Reachability Problem
• An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
• Title not available (Why is that?)

Cited In (5)

• On minimal elements in the set of integer nonnegative solutions of a system of linear equations
• Title not available (Why is that?)
• Mathematical Foundations of Computer Science 2005
• A structure to decide reachability in Petri nets
• \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\)

This page was built for publication: Finding a partial solution to a linear system of equations in positive integers

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