Improved lower and upper bounds for the number of feasible solutions to a knapsaek problem

DOI10.1080/02331938808843401zbMath0664.90059OpenAlexW2091700028MaRDI QIDQ3815861

Mihály Hujter

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938808843401

zbMATH Keywords

lower and upper boundsBrunn-Minkowski inequalitygeometrical methodsdiscrete knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Extremal problems concerning Kneser-graphs

Cites Work

• The Number of Feasible Solutions to a Knapsack Problem
• Bemerkung zu einer arbeit von achou über die anzahl zulässiger lösungen eines knapsack-problems
• A Remark on “an Inequality for the Number of Lattice Points in a Simplex”
• Lower and Upper Bounds for the Number of Lattice Points in a Simplex