Integer knapsacks: average behavior of the Frobenius numbers

DOI10.1287/MOOR.1090.0393MaRDI QIDQ3169061zbMATH OpenOpenAlexFDO

Authors Martin Henk, Iskander Aliev

Publication date 27 April 2011

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0810.0234

zbMATH Keywords

knapsack problemsuccessive minimaFrobenius numberinhomogeneous minimumdistribution of lattices

Mathematics Subject Classification ID

Integer programming (90C10) The Frobenius problem (11D07) Minima of forms (11H50)

Abstract: The main result of the paper shows that the asymptotic growth of the Frobenius number in average is significantly slower than the growth of the maximum Frobenius number.

Recommendations

• Feasibility of integer knapsacks
• Expected Frobenius numbers
• On the distance between Frobenius numbers
• Limit behaviour of large Frobenius numbers
• Generalized Frobenius numbers: bounds and average behavior

Cited in

(11)

• scientific article; zbMATH DE number 3910473 (Why is no real title available?)
• On the enumeration of the set of numerical semigroups with fixed Frobenius number.
• The asymptotic distribution of Frobenius numbers
• Commutative algebra and the linear Diophantine problem of Frobenius
• Integer matrices, sublattices of Z^m, and Frobenius numbers
• Symmetric semigroups with three generators
• On the structure of reduced kernel lattice bases
• Expected Frobenius numbers
• Geometric proof of Rødseth's formula for Frobenius numbers
• Feasibility of integer knapsacks
• Making change and finding repfigits: balancing a knapsack

This page was built for publication: Integer knapsacks: average behavior of the Frobenius numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169061)