A combined approach for analysing heuristic algorithms.
Jeroen CorstjensNguyen DangBenoît DepaireAn CarisPatrick De CausmaeckerPublished in: J. Heuristics (2019)
Keyphrases
- recently developed
- computational cost
- orders of magnitude
- learning algorithm
- running times
- combinatorial optimization
- times faster
- theoretical analysis
- computationally efficient
- beam search
- worst case
- dynamic programming
- computationally expensive
- search algorithm
- optimal solution
- heuristic methods
- exact algorithms
- exact and approximate
- benchmark datasets
- approximate solutions
- machine learning algorithms
- optimization problems
- evolutionary algorithm
- bayesian networks