Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An algorithm for a linear Diophantine equation and a problem of Frobenius

From MaRDI portal
Publication:1134177
Jump to:navigation, search

DOI10.1007/BF01403673zbMath0423.10010MaRDI QIDQ1134177

Harold Greenberg

Publication date: 1980

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132677

zbMATH Keywords

algorithmFrobenius problemlinear Diophantine equations


Mathematics Subject Classification ID

Integer programming (90C10) Software, source code, etc. for problems pertaining to number theory (11-04) Linear Diophantine equations (11D04)


Related Items

Efficient solution of linear diophantine equations, A better step-off algorithm for the knapsack problem, Frobenius Coin-Exchange Generating Functions, A relation between the knapsack and group knapsack problems



Cites Work

  • On a linear diophantine problem of Frobenius: an improved algorithm
  • On the linear diophantine problem of Frobenius.
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1134177&oldid=13184753"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 04:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki