Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem.
Panos M. PardalosK. G. RamakrishnanMauricio G. C. ResendeYong LiPublished in: SIAM J. Optim. (1997)
Keyphrases
- lower bound
- quadratic assignment problem
- branch and bound algorithm
- variance reduction
- upper bound
- branch and bound
- lower bounding
- combinatorial optimization
- randomly generated
- optimal solution
- sample size
- test problems
- np hard
- worst case
- lower and upper bounds
- objective function
- max sat
- lagrangian relaxation
- linear programming relaxation
- machine learning
- np complete
- knn
- training data