| 引用本文: | 刘继勇.数列最优成组剖分的一个动态算法.[J].国防科技大学学报,1986,(4):125-130.[点击复制] |
| Liu Jiyong.A Dynamic Algorithm Finding the Optimal Digit-Grouped Partition Number of Sequence[J].Journal of National University of Defense Technology,1986,(4):125-130[点击复制] |
|
| |
|
|
| 本文已被：浏览 4975次 下载 5040次 |
| 数列最优成组剖分的一个动态算法 |
| 刘继勇 |
|
()
|
| 摘要: |
| 数学工作者从铁道调车问题，抽象出一个数学问题，称为数列的成组剖分问题。本文给出一个递推公式，利用递推公式可以逐步减少数列中数值的个数，从而得到求数列最优成组剖分数的一个动态算法。 |
| 关键词: |
| DOI： |
| 投稿日期：1986-04-17 |
| 基金项目: |
|
| A Dynamic Algorithm Finding the Optimal Digit-Grouped Partition Number of Sequence |
| Liu Jiyong |
| Abstract: |
| From the train marshalling problem， mathematicians autline a mathematics model. cal1ed as "the digit-grouped partition of sequence"，and give some results. In this paper. we get a recursion formula，by which the number of digit of a sequence is reduced step by step，and obtain a dynamic algorithm solving a number of the optimal digit-grouped partition of sequence. |
| Keywords: |
|
|
