Lattice Preconditioning for the Real Relaxation Branch-And-Bound Approach for Integer Least Squares Problems

Journal of Global Optimization - Netherlands
doi 10.1007/s10898-014-0148-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Greville’s Method for Preconditioning Least Squares Problems

Advances in Computational Mathematics
Computational MathematicsApplied Mathematics
2011English

Solving Ellipsoid-Constrained Integer Least Squares Problems

SIAM Journal on Matrix Analysis and Applications
Analysis
2010English

Solving Box-Constrained Integer Least Squares Problems

IEEE Transactions on Wireless Communications
Electronic EngineeringApplied MathematicsComputer Science ApplicationsElectrical
2008English

A Branch-And-Bound Algorithm for Zero-One Mixed Integer Programming Problems

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1971English

Algorithms for Nonlinear Least-Squares Problems

1988English

On the Successive Projections Approach to Least-Squares Problems

SIAM Journal on Numerical Analysis
Computational MathematicsApplied MathematicsNumerical Analysis
1986English

On the Successive Projections Approach to Least-Squares Problems

1985English

Models and Algorithms for Distributionally Robust Least Squares Problems

Mathematical Programming, Series B
MathematicsSoftware
2013English

An Effective Branch-And-Bound Algorithm for Convex Quadratic Integer Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy