Algorithm 217: Minimum excess cost curve
William A. Briggs · Communications of the ACM · 1963
commentThis procedure utilizes a network-type description of a project to compute the minimum cost involved in expedition of the project completion date.Project tasks are identified and completion order specified by the vector pair I, J, which contain node numbers of the events starting and ending each task.The tasks are parameterized within the vectors crash, normal, and slope--which contain the crash or minimum task completion