The Frobenius Problem and Maximal Lattice Free Bodies

Let p = (p_{1},...,p_{n}) 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 non-negative integral combination of the p_{i}.In this note we relate the Frobenius problem to the topic of maximal lattice free bodies and describe an algorithm for n = 3.

MoreLess

Year of publication:	1990-06
Authors:	Scarf, Herbert E. ; Shallcross, David F.
Institutions:	Cowles Foundation for Research in Economics, Yale University
Subject:	Algorithm \| Frobenius problem

More details

Extent:	application/pdf
Series:	Cowles Foundation Discussion Papers.
Type of publication:	Book / Working Paper
Language:	English
Notes:	CFP 892. Published in Mathematics of Operation Research (August 1993), 18(3): 511-515 The price is None Number 945 12 pages
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005761443