"Project Scheduling in AND-OR Graphs: A Generalization of Dijkstra's Algorithm."

George M. Adelson-Velsky, Eugene Levner (2002)

> Home

Details and statistics

DOI: 10.1287/MOOR.27.3.504.311

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mor/Adelson-VelskyL02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/Adelson-VelskyL02
George M. Adelson-Velsky, Eugene Levner:
Project Scheduling in AND-OR Graphs: A Generalization of Dijkstra's Algorithm. Math. Oper. Res. 27(3): 504-517 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.