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;
Copyright © 2009 by INFORMS.