Integer points in knapsack polytopes and \(s\)-covering radius

zbMath1267.90071arXiv1211.3269MaRDI QIDQ1953532

Eva Linke, Martin Henk, Iskander M. Aliev

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

covering radiussuccessive minimainhomogeneous minimumKnapsack polytope(diagonal) Frobenius numbers

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items (1)

On the number of integer points in translated and expanded polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on generalized Frobenius numbers
• The multidimensional Frobenius problem
• An optimal lower bound for the Frobenius problem
• Frobenius problem and the covering radius of a lattice
• Geometry and growth rate of Frobenius numbers of additive semigroups
• A geometric inequality with applications to linear forms
• Lattice translates of a polytope and the Frobenius problem
• A property of polynomials with an application to Siegel's lemma
• Complexity of the Frobenius problem
• Generalized Frobenius numbers: bounds and average behavior
• Unbounded Discrepancy in Frobenius Numbers
• Feasibility of Integer Knapsacks
• An Extreme Family of Generalized Frobenius Numbers
• Convex and Discrete Geometry
• On a linear diophantine problem of Frobenius

This page was built for publication: Integer points in knapsack polytopes and \(s\)-covering radius