Considering a Classical Upper Bound on the Frobenius Number

Considering a Classical Upper Bound on the Frobenius Number

In this paper, we study the (classical) Frobenius problem, namely the problem of finding the largest integer that cannot be represented as a nonnegative integer combination of given, relatively prime, (strictly) positive integers (known as the Frobenius number). The main contribution of this paper a...

Full description

Bibliographic Details
Main Authors: Aled Williams, Daiki Haijima
Format: Article
Language:English
Published: MDPI AG 2024-12-01
Series:Mathematics
Subjects:
Frobenius problem
Frobenius number
Diophantine equations
knapsack problems
knapsack polytopes
integer programming
Online Access:https://www.mdpi.com/2227-7390/12/24/4029

Internet

https://www.mdpi.com/2227-7390/12/24/4029

Similar Items