On the use of fictitious bounds in tree search algorithms
Tree search algorithms for a minimization problem can be classified under two major categories. the first (breadth) category attempts to search the tree by branching from the node with the smallest lower bound. This serves to minimize the portion of the tree which is explicitly explored.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Other |
| Language: | English |
| Published: |
The Institute Of National Planning.
2018
|
| Subjects: | |
| Online Access: | http://repository.inp.edu.eg/xmlui/handle/123456789/3908 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Tree search algorithms for a minimization problem can be classified under two major categories. the first (breadth) category attempts to search the tree by branching from the node with the smallest lower bound. This serves to minimize the portion of the tree which is explicitly explored. |
|---|