The Frobenius Problem and Maximal Lattice Free Bodies

Herbert Scarf and David F. Shallcross
Additional contact information
David F. Shallcross: Thomas J. Watson Research Center, IBM

No 945, Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University

Abstract: 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.

Keywords: Algorithm; Frobenius problem (search for similar items in EconPapers)
Pages: 12 pages
Date: 1990-06
Note: CFP 892.
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Published in Mathematics of Operation Research (August 1993), 18(3): 511-515

Downloads: (external link)
https://cowles.yale.edu/sites/default/files/files/pub/d09/d0945.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found

Related works:
Chapter: The Frobenius Problem and Maximal Lattice Free Bodies (2008)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cwl:cwldpp:945

Ordering information: This working paper can be ordered from
Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA
The price is None.

Access Statistics for this paper

More papers in Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University Yale University, Box 208281, New Haven, CT 06520-8281 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Brittany Ladd ().