Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Making Change and Finding Repfigits: Balancing a Knapsack
verfasst von : Daniel Lichtblau
Erschienen in: Mathematical Software - ICMS 2006
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We will discuss knapsack problems that arise in certain computational number theory settings. A common theme is that the search space for the standard real relaxation is large; in a sense this translates to a poor choice of variables. Lattice reduction methods have been developed in the past few years to improve handling of such problems. We show explicitly how they may be applied to computation of Frobenius instances, Keith numbers (also called “repfigits”), and as a first step in computation of Frobenius numbers.