Almost optimal solution of initial-value problems by randomized and quantum algorithms.
Boleslaw Z. KacewiczPublished in: J. Complex. (2006)
Keyphrases
- optimization problems
- approximate solutions
- optimal solution
- combinatorial optimization
- test problems
- difficult problems
- benchmark problems
- computational problems
- randomized algorithms
- heuristic methods
- computationally efficient
- np hard problems
- practical problems
- computational cost
- search methods
- solution quality
- related problems
- computational geometry
- exact solution
- run times
- lower bound
- data structure
- objective function
- knapsack problem
- branch and bound algorithm
- branch and bound
- data mining techniques
- worst case
- significant improvement
- exact algorithms
- specific problems
- greedy algorithms
- reinforcement learning
- learning algorithm