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

Bibliographische Detailangaben

Hauptverfasser:	Bazraa, Mokhtar S., Elshafei, Alwalid N.
Format:	Other
Sprache:	Englisch
Veröffentlicht:	The Institute Of National Planning. 2018
Schlagworte:	Bounds. Trees. Agriculture.
Online-Zugang:	http://repository.inp.edu.eg/handle/123456789/3908
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!