Feasibility of Integer Knapsacks
From MaRDI portal
Publication:3083317
DOI10.1137/090778043zbMath1211.90132arXiv0911.4186OpenAlexW2069926530MaRDI QIDQ3083317
Martin Henk, Iskander M. Aliev
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.4186
Integer programming (90C10) Combinatorial optimization (90C27) Lattices and convex bodies (number-theoretic aspects) (11H06) The Frobenius problem (11D07)
Related Items (10)
LLL-reduction for integer knapsacks ⋮ The Frobenius problem over number fields with a real embedding ⋮ Bounds on generalized Frobenius numbers ⋮ Integer points in knapsack polytopes and \(s\)-covering radius ⋮ Homeomorphic measures on stationary Bratteli diagrams ⋮ On the lattice programming gap of the group problems ⋮ Proximity bounds for random integer programs ⋮ Proximity bounds for random integer programs ⋮ Positive semigroups and generalized Frobenius numbers over totally real number fields ⋮ A Polyhedral Frobenius Theorem with Applications to Integer Optimization
This page was built for publication: Feasibility of Integer Knapsacks
