A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems (Q4533475): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.10017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2146604050 / rank | |||
Normal rank | |||
Revision as of 23:39, 19 March 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
