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 iterations. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1970
Accession Number
AD0713617

Entities

People

  • B. L. Fox

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Composite Materials
  • Iterations
  • Materials
  • Mathematics

Readers

  • Operations Research