Title :
On a search problem related to branch-and-bound procedures
Author :
Karp, R.M. ; Saks, M. ; Wigderson, A.
Keywords :
Arithmetic; Binary trees; Computer science; Costs; Mathematics; Read-write memory; Registers; Search problems; Upper bound;
Conference_Titel :
Foundations of Computer Science, 1986., 27th Annual Symposium on
Conference_Location :
Toronto, ON, Canada
Print_ISBN :
0-8186-0740-8
DOI :
10.1109/SFCS.1986.34
