Local Enumeration and Majority Lower Bounds.
Mohit GurumukhaniRamamohan PaturiPavel PudlákMichael E. SaksNavid TalebanfardPublished in: CCC (2024)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- branch and bound
- objective function
- lower and upper bounds
- exhaustive search
- upper and lower bounds
- search space
- lower bounding
- optimal cost
- optimal solution
- worst case
- quadratic assignment problem
- dynamic programming
- randomly generated problems
- running times
- online algorithms
- lagrangian relaxation
- linear programming relaxation
- data sets
- search algorithm
- linear program
- simulated annealing
- special case