The Frobenius Problem and Maximal Lattice Free Bodies
Herbert E. Scarf, David F. Shallcross · Mathematics of Operations Research · 1993
Let p = (p1, …, pn) be a vector of positive integers whose greatest common divisor is unity. The Frobenius problem is to find the largest integer f* which cannot be written as a nonnegative integral combination of the pi. In this note we relate the Frobenius problem to the topic of maximal lattice free bodies and describe an algorithm for n = 3.