(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.

Ngā taipitopito rārangi puna kōrero

Ngā kaituhi matua:	Bazraa, Mokhtar S., Elshafei, Alwalid N.
Hōputu:	Other
Reo:	Ingarihi
I whakaputaina:	The Institute Of National Planning. 2018
Ngā marau:	Bounds. Trees. Agriculture.
Urunga tuihono:	http://repository.inp.edu.eg/handle/123456789/3908
Ngā Tūtohu:	Tāpirihia he Tūtohu Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!