A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems

From MaRDI portal
Publication:4533475












This page was built for publication: A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4533475)