Circuit Lower Bounds for Heuristic MA.
Alexander KnopPublished in: Electron. Colloquium Comput. Complex. (2013)
Keyphrases
- lower bound
- set of randomly generated instances
- optimal cost
- upper bound
- optimal solution
- lower bounding
- lower and upper bounds
- running times
- linear programming relaxation
- lagrangian relaxation
- branch and bound algorithm
- high speed
- branch and bound
- objective function
- search algorithm
- vc dimension
- expected cost
- np hard
- dynamic programming
- combinatorial optimization
- quadratic assignment problem
- worst case
- simulated annealing
- circuit design
- genetic algorithm
- data structure
- strongly np hard
- min sum
- integer programming formulations