The Frobenius Problem and Maximal Lattice Free Bodies

Herbert Scarf and David F. Shallcross
Additional contact information
David F. Shallcross: Bell Communications Research

Chapter 7 in Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research, 2008, pp 149-153 from Palgrave Macmillan

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

Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Working Paper: The Frobenius Problem and Maximal Lattice Free Bodies (1990)
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:pal:palchp:978-1-137-02441-1_7

Ordering information: This item can be ordered from
http://www.palgrave.com/9781137024411

DOI: 10.1057/9781137024411_7

Access Statistics for this chapter

More chapters in Palgrave Macmillan Books from Palgrave Macmillan
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().