A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory.

András Faragó

Published in: AAIM (2018)

Keyphrases

hard problems
objective function
cost function
learning algorithm
np hard
dynamic programming
optimization algorithm
simulated annealing
convex hull
search strategy
computational complexity
combinatorial optimization
complexity theory
voronoi diagram
heuristic methods
knapsack problem
tree structure
feature points