The Frobenius problem and maximal lattice free bodies

0.00 Avg rating—0 Votes

Article ID:	iaor1994719
Country:	United States
Volume:	18
Issue:	3
Start Page Number:	511
End Page Number:	515
Publication Date:	Aug 1993
Journal:	Mathematics of Operations Research
Authors:	Shallcross David F., Scarf Herbert E.
Keywords:	combinatorial analysis

Abstract:

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 the authors relate the Frobenius problem to the topic of maximal lattice free bodies and describe an algorithm for n=3.

Reviews

Required fields are marked *. Your email address will not be published.