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

Номзүйн дэлгэрэнгүй

Үндсэн зохиолчид:	Bazraa, Mokhtar S., Elshafei, Alwalid N.
Формат:	Other
Хэл сонгох:	англи
Хэвлэсэн:	The Institute Of National Planning. 2018
Нөхцлүүд:	Bounds. Trees. Agriculture.
Онлайн хандалт:	http://repository.inp.edu.eg/handle/123456789/3908
Шошгууд:	Шошго нэмэх Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!