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.
Du, Ding-Zhu; Hwang, Frank K.; Jia, Xiaohua; Ngo, Hung Q..
Optimal Consecutive-k-out-of-n: G Cycle for n <= 2k+1.
Retrieved from the University of Minnesota Digital Conservancy,
Content distributed via the University of Minnesota's Digital Conservancy may be subject to additional license and use restrictions applied by the depositor.