Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm (Q5704094): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: George M. Adelson-Velsky / rank | |||
| Property / author | |||
| Property / author: George M. Adelson-Velsky / rank | |||
Normal rank | |||
| 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/moor.27.3.504.311 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978543710 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:57, 20 March 2024
scientific article; zbMATH DE number 2228259
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
