Benefits and Problems of using cycle-cutset within interative improvement algorithms.
Harald Meyer auf'm HofePublished in: PuK (2000)
Keyphrases
- np hard problems
- optimization problems
- significant improvement
- computational problems
- benchmark problems
- orders of magnitude
- constraint programming
- run times
- problems in computer vision
- approximate solutions
- test problems
- combinatorial optimization
- times faster
- learning algorithm
- computationally efficient
- genetic algorithm
- hard problems
- np hard
- specific problems
- exact algorithms
- related problems
- practical problems
- difficult problems
- bayesian networks
- machine learning
- computationally hard
- computational geometry
- clustering algorithm
- partial solutions
- computational complexity
- evolutionary algorithm
- knapsack problem
- search methods
- neural network
- worst case
- metaheuristic
- simulated annealing
- theoretical analysis