The optimal design for a kind of sequencing problem of N-set is investigated, and the least substitution times of the converse ordinal of N-set is obtained.
研究N元集的一类排序问题的最优设计，得到了N元集逆序排序所需的最少抽换次数，同时也给出了相关的结果和算法的实。
The optimal design for a kind of sequencing problem of N-set is investigated, and the least substitution times of the converse ordinal of N-set is obtained.
研究N元集的一类排序问题的最优设计，得到了N元集逆序排序所需的最少抽换次数，同时也给出了相关的结果和算法的实。
应用推荐