(1212) 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.
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Other |
| Jazyk: | angličtina |
| Vydáno: |
The Institute Of National Planning.
2018
|
| Témata: | |
| On-line přístup: | http://repository.inp.edu.eg/handle/123456789/3908 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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. |
|---|