Optimal consecutive-k-out-of-(2k+1):: G cycle

被引：4

作者：

Du, DZ ^{[1
]}

Hwang, FK

Jung, Y

Ngo, HQ

机构：

[1] Chinese Acad Sci, Inst Appl Math, Beijing, Peoples R China

[2] Natl Chiao Tung Univ, Dept Appl Math, Hsinchu, Taiwan

[3] Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA

来源：

JOURNAL OF GLOBAL OPTIMIZATION | 2001年 / 19卷 / 01期

基金：

美国国家科学基金会;

关键词：

invariant optimal assignment; consecutive-k-out-of-n; G cycle;

D O I：

10.1023/A:1008308211943

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We present a complete proof for the invariant optimal assignment for consecutive-k-out-of-(2k + 1): G cycle, which was proposed by Zuo and Kao in 1990 with an incomplete proof, pointed out recently by Jalali, Hawkes, Cui and Hwang.

引用

页码：51 / 60

页数：10