A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems (Q4533475)
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 consecutivek-out-of-n-systems |
scientific article; zbMATH DE number 1753724
| 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 consecutivek-out-of-n-systems |
scientific article; zbMATH DE number 1753724 |
Statements
A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems (English)
0 references
11 June 2002
0 references
optimal replacement policies
0 references
branch-and-bound algorithm
0 references
0 references
0.9609677195549012
0 references
0.9018075466156006
0 references
0.8704657554626465
0 references
0.8249505162239075
0 references
0.7788397669792175
0 references
