Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems

Francesco Brioschi and Shimon Even
Additional contact information
Francesco Brioschi: Harvard University, Cambridge, Massachusetts
Shimon Even: Harvard University, Cambridge, Massachusetts

Operations Research, 1970, vol. 18, issue 1, 66-81

Abstract: This paper deals with the solution to a discrete optimization problem by decomposition. It develops a criterion for ranking the decomposition procedures, discusses the properties of the optimal decompositions, and gives an algorithm for finding the best decomposition in the case of no storage limitation.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.1.66 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:18:y:1970:i:1:p:66-81

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().