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

DOI10.1023/A:1008308211943MaRDI QIDQ1595898zbMATH OpenFDO

Authors Du Ding-Zhu, Frank K. Hwang, Yunjae Jung, Hung Q. Ngo

Publication date 18 February 2001

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1008308211943

zbMATH Keywords

Consecutive-k-out-of-n: G cycleInvariant optimal assignment

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1
• Sequential construction of a circular consecutive-2 system
• A comment on consecutive-2-out-of-n systems
• A note on the proof for the optimal consecutive-k-out-of-n:G line for n 2k
• The optimal consecutive-\(k\)-out-of-\(n\):\(G\) line for \(n \leqslant 2k\)

Cited in

(4)

• The optimal consecutive-\(k\)-out-of-\(n\):\(G\) line for \(n \leqslant 2k\)
• A note on the proof for the optimal consecutive-k-out-of-n:G line for n 2k
• scientific article; zbMATH DE number 3965044 (Why is no real title available?)
• Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1

This page was built for publication: Optimal consecutive-\(k\)-out-of-(\(2k+1\)): \(G\) cycle

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