Description: French back-Bound pruning method similar to the problem is a state-space search tree algorithm solution. Priority queue with priority to the realization of the high priority that is, the lower the value of the estimated function of the node at the beginning of the more close to the location of the queue.
To Search:
File list (Check if you may need any files):
TASKS.C
Download