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.
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Other |
| 言語: | 英語 |
| 出版事項: |
The Institute Of National Planning.
2018
|
| 主題: | |
| オンライン･アクセス: | http://repository.inp.edu.eg/xmlui/handle/123456789/3908 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|