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

Detaylı Bibliyografya

Asıl Yazarlar:	Bazraa, Mokhtar S., Elshafei, Alwalid N.
Materyal Türü:	Other
Dil:	İngilizce
Baskı/Yayın Bilgisi:	The Institute Of National Planning. 2018
Konular:	Bounds. Trees. Agriculture.
Online Erişim:	http://repository.inp.edu.eg/handle/123456789/3908
Etiketler:	Etiketle Etiket eklenmemiş, İlk siz ekleyin!