Bayesian Optimization Algorithms for Dynamic Problems.
Milos KoblihaJosef SchwarzJiri OcenasekPublished in: EvoWorkshops (2006)
Keyphrases
- optimization problems
- combinatorial optimization
- discrete optimization
- convex optimization problems
- efficient optimization
- test problems
- optimization methods
- benchmark problems
- orders of magnitude
- optimization approaches
- computationally efficient
- related problems
- monte carlo methods
- evolutionary algorithm
- difficult problems
- mathematical programming
- run times
- knapsack problem
- np complete
- worst case
- monte carlo sampling
- convex relaxation
- specific problems
- computational problems
- continuous optimization
- problems in computer vision
- approximate solutions
- metaheuristic
- dynamic environments
- partial solutions
- combinatorial optimization problems
- theoretical analysis
- data mining techniques
- significant improvement
- data structure
- learning algorithm