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).

Saved in:

Bibliographic Details
Published in:	Wuhan University journal of natural sciences Vol. 2; no. 3; pp. 287 - 291
Main Authors:	Xusong, Xu, Dacheng, Liu, Jing, Lu
Format:	Journal Article
Language:	English
Published:	Heidelberg Springer Nature B.V 01.09.1997
Subjects:	Algorithms Dynamic programming Workpieces
ISSN:	1007-1202, 1993-4998
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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).
Bibliography:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ISSN:	1007-1202 1993-4998
DOI:	10.1007/BF02829905