Heuristic quadratic approximation for the universality theorem.
Gonzalo HernándezRafael PlazaLuis SalinasPublished in: Clust. Comput. (2014)
Keyphrases
- cellular automata
- closed form
- search algorithm
- objective function
- taylor series expansion
- tabu search
- simulated annealing
- dynamic programming
- special case
- limit theorems
- optimal solution
- bin packing
- linear programming relaxation
- semidefinite
- genetic algorithm
- approximation schemes
- heuristic solution
- von neumann
- greedy heuristic
- timetabling problem
- heuristic function
- mixed integer programming
- solution quality
- knapsack problem
- search strategies
- feasible solution
- error bounds
- computational complexity
- pairwise
- linear programming