On the Structure of Reduced Kernel Lattice Bases

DOI10.1287/moor.2013.0628zbMath1311.11058OpenAlexW2124300890MaRDI QIDQ5244870

Frederik von Heymann, Karen Aardal

Publication date: 31 March 2015

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

Full work available at URL: https://doi.org/10.1287/moor.2013.0628

zbMATH Keywords

probabilistic analysisLLL-algorithmlattice reformulationlattice bases

Mathematics Subject Classification ID

Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
• On Siegel's lemma
• Column basis reduction and decomposable knapsack problems
• Lattice based extended formulations for integer linear equality systems
• Sharp mean-variance bounds for Jensen-type inequalities
• Factoring polynomials with rational coefficients
• LLL-reduction for integer knapsacks
• Weighted sums of certain dependent random variables
• Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
• Integer Knapsacks: Average Behavior of the Frobenius Numbers
• The Generalized Basis Reduction Algorithm
• An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
• A Class of Hard Small 0-1 Programs
• Probability Inequalities for Sums of Bounded Random Variables
• Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs
• Hard Equality Constrained Integer Knapsacks

This page was built for publication: On the Structure of Reduced Kernel Lattice Bases