Tools for Tree Searches: Branch‐and‐Bound and A Algorithms

Autor:	Casiano Rodríguez, Gara Miranda, Coromoto León
Rok vydání:	2008
Předmět:	Red–black tree k-d tree Tree (data structure) Tree traversal Theoretical computer science Branch and bound Computer science Search algorithm Optimal binary search tree Depth-first search Algorithm
Zdroj:	Optimization Techniques for Solving Complex Problems
DOI:	10.1002/9780470411353.ch12
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::ed05c687cf38f95be8c349e8580b1ae2 https://doi.org/10.1002/9780470411353.ch12 Zobrazit plný text záznamu