(algorithmic technique)
Definition: (1) A high-level algorithmic framework or approach that can be specialized to solve optimization problems. (2) A high-level strategy that guides other heuristics in a search for feasible solutions.
See also optimization problem, simulated annealing.
Author: PEB
FOLDOC definition. The Metaheuristic research group.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Mon Dec 5 10:39:26 2005.
HTML page formatted Mon Dec 5 10:39:39 2005.
Cite this as:
Paul E. Black, "metaheuristic", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/metaheuristic.html
