Abstract
A model is described that captures the essential elements common to all branch-and-bound procedures. Storage limitations in these procedures raise an interesting search problem. Deterministic and probabilistic algorithms for this problem presented. The algorithms imply that branch-and-bound can be performed with very small storage and only slightly superlinear time.
Original language | English |
---|---|
Title of host publication | Annual Symposium on Foundations of Computer Science (Proceedings) |
Publisher | IEEE |
Pages | 19-28 |
Number of pages | 10 |
ISBN (Print) | 0818607408, 9780818607400 |
DOIs | |
State | Published - 1986 |
Externally published | Yes |
Publication series
Name | Annual Symposium on Foundations of Computer Science (Proceedings) |
---|---|
ISSN (Print) | 0272-5428 |