MINIMIZING THE NUMBER OF OPERATIONS IN CERTAIN DISCRETE VARIABLE OPTIMIZATION PROBLEMS.

Abstract

The paper deals with the solution by decomposition to a discrete optimization problem. A criterion for ranking the decomposition procedures is developed and properties of the optimal decompositions are discussed. An algorithm for finding the best decomposition in the case of no storage limitation is given. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1968
Accession Number
AD0676560

Entities

People

  • Francesco Brioschi
  • Shimon Even

Organizations

  • Harvard University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Decomposition
  • Heuristic Methods
  • Mathematics
  • Optimization

Fields of Study

  • Mathematics

Readers

  • Computational Fluid Dynamics (CFD)
  • Organic Chemistry
  • Systems Analysis and Design