DISCRETE PROGRAMMING APPLICATIONS OF TECHNIQUES FOR HANDLING A COMMON LIST STRUCTURE,

Abstract

It is pointed out how two list-handling algorithms: heapsort and balanced tree search, can accelerate incremental allocation and branch and bound algorithms--in particular certain integer programming algorithms. The use of incremental allocation and branch and bound algorithms has been important in solving diverse operations research problems arising in inventory control, redundancy optimization, target allocation, and circuit minimization. Any scheme that can make these algorithms more efficient will be of great practical significance. For the incremental allocation application, when no buffering is needed, heapsort seems preferable to handle the storage problem, and it appears that balanced tree search will be better suited for branch and bound and algorithms. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1969
Accession Number
AD0688211

Entities

People

  • B. L. Fox

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Inventory
  • Inventory Control
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Optimization
  • Redundancy

Fields of Study

  • Computer science

Readers

  • Computational Linguistics
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Regression Analysis.