A Dynamic Algorithm Finding the Optimal Digit-Grouped Partition Number of Sequence
DOI:
CSTR:
Author:
Affiliation:
Clc Number:
Fund Project:
Article
|
Figures
|
Metrics
|
Reference
|
Related
|
Cited by
|
Materials
|
Comments
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.
Reference
Related
Cited by
Get Citation
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.