Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems

DOI10.1007/s10898-014-0148-4zbMath1298.90053OpenAlexW2112767856MaRDI QIDQ2250079

Xiao-Wen Chang, Miguel F. Anjos, Wen-Yang Ku

Publication date: 4 July 2014

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/85928236/Lattice_Preconditioning_for_the_Real_Relaxation_Branch_and_Bound_Approach_for_Integer_Least_Squares_Problems.pdf

zbMATH Keywords

preconditioningbox constraintslattice reductioninteger least squaresbranch-and-bound methods

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Convex reformulation for binary quadratic programming problems via average objective value maximization

Uses Software

• CPLEX
• MILES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
• Non-standard approaches to integer programming
• An effective branch-and-bound algorithm for convex quadratic integer programming
• Column basis reduction and decomposable knapsack problems
• Lattice based extended formulations for integer linear equality systems
• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Euclidean distances and least squares problems for a given set of vectors
• A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
• Algorithms for the Shortest and Closest Lattice Vector Problems
• Integer Programming with a Fixed Number of Variables
• Integer Programming and Algorithmic Geometry of Numbers
• Solving Ellipsoid-Constrained Integer Least Squares Problems
• Closest point search in lattices
• On the Structure of Reduced Kernel Lattice Bases
• Progress on LLL and Lattice Reduction
• The LLL Algorithm and Integer Programming
• Effects of the LLL Reduction on the Success Probability of the Babai Point and on the Complexity of Sphere Decoding
• Benchmarking optimization software with performance profiles.

This page was built for publication: Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems