The diophantine problem of Frobenius: A close bound

DOI10.1016/0166-218X(89)90019-XzbMath0671.10011MaRDI QIDQ1119676

Azaria Paz, Hugo Krawczyk

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

conductoralgorithmFrobenius problempolynomiallinear diophantine equationsFrobenius number

Mathematics Subject Classification ID

Linear Diophantine equations (11D04)

Related Items

An enumeration algorithm for all integers nonrepresentable by some positive integers, Lattice translates of a polytope and the Frobenius problem, A relation between the knapsack and group knapsack problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representations of integers by linear forms in nonnegative integers
• Integer Programming with a Fixed Number of Variables
• A Minimal-Path Algorithm for the "Money Changing Problem"
• On the linear diophantine problem of Frobenius.
• On a Problem of Partitions