A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in <i>K</i>-Out-of-<i>N</i> Systems (Q4868802)
From MaRDI portal
scientific article; zbMATH DE number 853122
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in <i>K</i>-Out-of-<i>N</i> Systems |
scientific article; zbMATH DE number 853122 |
Statements
A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in <i>K</i>-Out-of-<i>N</i> Systems (English)
0 references
29 April 1996
0 references
discrete time, infinite-horizon, dynamic programming
0 references
replacement of components
0 references
branch-and-bound
0 references
