Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks (Q4153908): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.26.1.111 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2100500633 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:43, 19 March 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
