Bayesian approach for randomization of heuristic algorithms of discrete programming.
Jonas MockusAudris MockusLinas MockusPublished in: Randomization Methods in Algorithm Design (1997)
Keyphrases
- computational cost
- solution quality
- programming paradigms
- computational complexity
- greedy heuristic
- heuristic search algorithms
- exact algorithms
- theoretical analysis
- heuristic methods
- computational efficiency
- orders of magnitude
- running times
- programming environment
- privacy preserving
- optimal solution
- benchmark datasets
- programming language
- general purpose
- dynamic programming
- np hard
- lower bound
- data structure