A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems (Q4533475): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q115150511, #quickstatements; #temporary_batch_1707252663060 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:39, 7 February 2024
scientific article; zbMATH DE number 1753724
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
