Mathematics of Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 34, No. 3, August 2009, pp. 698-705
DOI: 10.1287/moor.1090.0393
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Google Scholar
Right arrow Articles by Aliev, I.
Right arrow Articles by Henk, M.

Integer Knapsacks: Average Behavior of the Frobenius Numbers

Iskander Aliev, Martin Henk

School of Mathematics and Wales Institute of Mathematical and Computational Sciences, Cardiff University, Cardiff, Wales, CF24 4AG United Kingdom
Institut für Algebra und Geometrie, Otto-von-Guericke Universität Magdeburg, D-39106 Magdeburg, Germany

alievi{at}cf.ac.uk
henk{at}math.uni-magdeburg.de

The largest integer that cannot be represented as a nonnegative integral combination of given set of positive integers is called the Frobenius number of these integers. We show that the asymptotic growth of the Frobenius number on average is significantly slower than the growth of the maximum Frobenius number.

Key Words: knapsack problem; Frobenius number; successive minima; inhomogeneous minimum; distribution of lattices
History: Received: October 2, 2008; revision received: February 24, 2009;





HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2009 by INFORMS.