LLL-reduction for integer knapsacks
From MaRDI portal
Publication:1928499
DOI10.1007/s10878-011-9411-5zbMath1282.90146arXiv1012.3182OpenAlexW2171902997MaRDI QIDQ1928499
Martin Henk, Iskander M. Aliev
Publication date: 3 January 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.3182
Related Items (3)
The Distributions of Functions Related to Parametric Integer Optimization ⋮ On the Structure of Reduced Kernel Lattice Bases ⋮ On polynomial-time solvable linear Diophantine problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Frobenius problem and the covering radius of a lattice
- On Lovász' lattice reduction and the nearest lattice point problem
- A generalization of a result of Sylvester's
- A geometric inequality with applications to linear forms
- Factoring polynomials with rational coefficients
- Lattice translates of a polytope and the Frobenius problem
- Geometric algorithms and combinatorial optimization
- Testing integer knapsacks for feasibility
- Complexity of the Frobenius problem
- Faster algorithms for Frobenius numbers
- Approximate Nonlinear Optimization over Weighted Independence Systems
- Feasibility of Integer Knapsacks
- Parametric Integer Programming in Fixed Dimension
- Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester
- Hard Equality Constrained Integer Knapsacks
This page was built for publication: LLL-reduction for integer knapsacks
