"The Fastest Algorithm for the Pert Problem with AND-and OR-Nodes (The ..."

E. A. Dinic (1990)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2002-10-09

- no documents available
- export record
  dblp key:
  - conf/ipco/Dinic90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipco/Dinic90
E. A. Dinic:
The Fastest Algorithm for the Pert Problem with AND-and OR-Nodes (The New-Product-New-Technology Problem). IPCO 1990: 185-187

a service of

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.