Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems.
Miguel F. AnjosXiao-Wen ChangWen-Yang KuPublished in: J. Glob. Optim. (2014)
Keyphrases
- branch and bound
- least squares
- integer variables
- branch and bound algorithm
- randomly generated problems
- lower bound
- network design problem
- combinatorial optimization
- branch and bound procedure
- search algorithm
- column generation
- branch and bound method
- partial solutions
- optimization problems
- tree search
- np complete
- upper bound
- optimal solution
- integer programming problems
- linear programming relaxation
- search space
- previously solved
- neural network
- lagrangian heuristic
- cutting plane
- mixed integer programming
- mathematical programming
- metaheuristic
- probabilistic model