A new dynamic programming algorithm to workspiece sort problem
This paper provides a new dynamic programming algorithm for solving workpiese sort problem This algorithm sort set of n workpieces in the calculating time of O(n).
Key wordsworkpiece sort problem dynamic programming algorithm calculating time of O(n)
Unable to display preview. Download preview PDF.
- 1.Editing and writing group of operations research.Oprations Research, Beijing: Tsinghua University press, 1988, 281–282Google Scholar
- 2.Horowltz E, Sahni S.Gundamentals of computer algorithm. London: Pitman publishing limited, 1979, 198–203Google Scholar
- 3.Xu Xusong.Introduction of data structure and algorithm. Beijing: Electronic industry press, 1996. 292–298Google Scholar
© Springer 1997