Answers are grounded in this paper and cite their sources.
Given a reliability redundancy optimization problem in itsdiscreteversion, it is possible to transform such integer problem into a correspondingbinaryproblem in log-time. A simple discrete-binary transformation is presented in this paper. The proposed transformation is illustrated using an example taken from the reliability literature. An immediate implication is that a standard exact dynamic programming approach may easily solve instances to optimality that were usually only solved heuristically.
No takes yet. Share an insight, caveat, or question.
Caserta et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: