Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm (Q5704094)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2228259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm |
scientific article; zbMATH DE number 2228259 |
Statements
Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm (English)
0 references
11 November 2005
0 references
project scheduling, AND-OR graphs, Dijkstra's algorithm, polynomial algorithm
0 references
0.7909666299819946
0 references
0.7677223086357117
0 references
