How to Store It,
Abstract
Storage layout for branch-and-bound algorithms is discussed. A composite branching rule, alternating between backtracking and branching from the point corresponding to the minimum bound, is recommended as the best compromise between reducing storage and the number of interations. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1971
- Accession Number
- AD0732638
Entities
People
- B. L. Fox
Organizations
- RAND Corporation