An $O(N^3 )$ Algorithm for Optimal Replacement Problems (Q3220052)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3887401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $O(N^3 )$ Algorithm for Optimal Replacement Problems |
scientific article; zbMATH DE number 3887401 |
Statements
An $O(N^3 )$ Algorithm for Optimal Replacement Problems (English)
0 references
1984
0 references
policy iterations
0 references
computational complexity
0 references
optimal replacement policy
0 references
Markovian deterioration
0 references
0.8531748652458191
0 references
0.824110746383667
0 references
0.7986375689506531
0 references
