Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks (Q4153908): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:31, 6 February 2024
scientific article; zbMATH DE number 3586803
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks |
scientific article; zbMATH DE number 3586803 |
Statements
Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks (English)
0 references
1978
0 references