When to use which heuristic: A rational solution to the strategy selection problem.
Falk LiederThomas L. GriffithsPublished in: CogSci (2015)
Keyphrases
- optimal solution
- search strategy
- solution quality
- search algorithm
- greedy strategy
- greedy heuristic
- vehicle routing problem with stochastic demands
- finding an optimal solution
- approximate solutions
- locally optimal
- mixed integer programming
- initial solution
- decision making
- dynamic programming
- closed form
- optimal or near optimal
- heuristic solution
- heuristic search algorithms
- beam search
- tabu search
- greedy algorithm
- lagrangian relaxation
- search procedure
- integer programming
- branch and bound algorithm
- search strategies
- branch and bound