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...
Saved in:
| Main Authors: | Aled Williams, Daiki Haijima |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-12-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/12/24/4029 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Machine Learning-Driven Optimization for Solution Space Reduction in the Quadratic Multiple Knapsack Problem
by: Diego Yanez-Oyarce, et al.
Published: (2025-01-01) -
On some extensions for degenerate Frobenius-Euler-Genocchi polynomials with applications in computer modeling
by: Waseem Ahmad Khan, et al.
Published: (2024-12-01) -
Projection solutions of Frobenius-Perron operator equations
by: Jiu Ding, et al.
Published: (1993-01-01) -
Investigation of The Effect of Feeding Period in Honey Bee Algorithm
by: Mustafa Kaya
Published: (2022-12-01) -
Contrefaire, subvertir. Portrait de Frobenius / Shrobénius dans Le Devoir de violence de Yambo Ouologuem
by: Éléonore Devevey
Published: (2019-05-01)