A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in <i>K</i>-Out-of-<i>N</i> Systems (Q4868802)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in K-Out-of-N Systems |
scientific article; zbMATH DE number 853122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9609677195549012
0 references
0.901095688343048
0 references
0.871708333492279
0 references
0.8455519676208496
0 references
0.8047702312469482
0 references
