𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a linear diophantine problem of Frobenius: an improved algorithm

✍ Scribed by B. R. Heap; M. S. Lynn

Publisher
Springer-Verlag
Year
1965
Tongue
English
Weight
305 KB
Volume
7
Category
Article
ISSN
0029-599X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Linear Diophantine Problem of Fro
On the Linear Diophantine Problem of Frobenius
✍ J.L. Davison πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 351 KB

Suppose \(a, b, c\) are three positive integers with \(\mathrm{gcd}=1\). We consider the function \(f(a, b, c)\) defined to be the largest integer not representable as a positive integral linear combination of \(a, b, c\). We give a new lower bound for \(f(a, b, c)\) which is shown to be tight, and

On a Linear Diophantine Problem of Frobe
On a Linear Diophantine Problem of Frobenius: Extending the Basis
✍ Stefan Matthias Ritter πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 233 KB

Let X k =[a 1 , a 2 , ..., a k ], k>1, be a subset of N such that gcd(X k )=1. We shall say that a natural number n is dependent (on X k ) if there are nonnegative integers x i such that n has a representation n= k i=1 x i a i , else independent. The Frobenius number g(X k ) of X k is the greatest i

An improved algorithm for the minmax reg
An improved algorithm for the minmax regret median problem on a tree
✍ Igor Averbakh; Oded Berman πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a β€œminmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because