Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems
- 1 February 1970
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 18 (1) , 66-81
- https://doi.org/10.1287/opre.18.1.66
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.Keywords
This publication has 0 references indexed in Scilit: