On the variable-depth-search heuristic for the linear-cost generalized assignment problem.
Bertrand M. T. LinY. S. HuangH. K. YuPublished in: Int. J. Comput. Math. (2001)
Keyphrases
- search algorithm
- search effort
- variable ordering
- heuristic function
- search strategies
- search procedure
- search space
- fixed cost
- search strategy
- exhaustive search
- forward search
- optimal solution
- optimal cost
- heuristic search algorithms
- cost sensitive
- depth map
- constraint satisfaction
- tree search algorithm
- dynamic programming
- pattern databases
- game tree search
- tabu search
- search heuristics
- branch and bound algorithm
- beam search
- expected cost
- continuous variables
- hill climbing
- branch and bound
- total cost
- solution space