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

Detalles Bibliográficos

Autores principales:	Bazraa, Mokhtar S., Elshafei, Alwalid N.
Formato:	Other
Lenguaje:	inglés
Publicado:	The Institute Of National Planning. 2018
Materias:	Bounds. Trees. Agriculture.
Acceso en línea:	http://repository.inp.edu.eg/handle/123456789/3908
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!