Hard Equality Constrained Integer Knapsacks

DOI10.1287/moor.1040.0099zbMath1082.90066OpenAlexW2105277260MaRDI QIDQ5704196

Arjen K. Lenstra, Karen Aardal

Publication date: 11 November 2005

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

Full work available at URL: https://infoscience.epfl.ch/record/149458/files/149458.pdf

zbMATH Keywords

Frobenius numberlattice basis reductionbranching on hyperplanes

Mathematics Subject Classification ID

Integer programming (90C10) Computer solution of Diophantine equations (11Y50) Linear Diophantine equations (11D04)

Related Items (15)

Column basis reduction and decomposable knapsack problems ⋮ Lattice based extended formulations for integer linear equality systems ⋮ Lattice-based algorithms for number partitioning in the hard phase ⋮ LLL-reduction for integer knapsacks ⋮ A study of lattice reformulations for integer programming ⋮ Compressing branch-and-bound trees ⋮ Bounds on the size of branch-and-bound proofs for integer knapsacks ⋮ Thinner is not always better: cascade knapsack problems ⋮ A Euclid style algorithm for MacMahon's partition analysis ⋮ The generic Gröbner walk ⋮ An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection ⋮ Lattice Reformulation Cuts ⋮ Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices ⋮ Unnamed Item ⋮ On the Structure of Reduced Kernel Lattice Bases

This page was built for publication: Hard Equality Constrained Integer Knapsacks