Optimal Consecutive-k-out-of-n: G Cycle for n <= 2k+1
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Optimal Consecutive-k-out-of-n: G Cycle for n <= 2k+1
Published Date
2000-10-02
Publisher
Type
Report
Abstract
We present a complete proof for the invariant optimal assignment for consecutive-k-out-of-n: G Cycle for k , which was proposed by Zuo and Kao in 1990 with an incomplete proof, pointed out recently by Jalali, Hawkes, Cui, and Hwang.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Technical Report; 00-050
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Du, Ding-Zhu; Hwang, Frank K.; Jia, Xiaohua; Ngo, Hung Q.. (2000). Optimal Consecutive-k-out-of-n: G Cycle for n <= 2k+1. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215437.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.