Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks (Q4153908)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks |
scientific article; zbMATH DE number 3586803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
