default search action

combined dblp search
author search
venue search
publication search

ask others

"Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks."

Prabuddha De et al. (1997)

> Home

Details and statistics

DOI: 10.1287/OPRE.45.2.302

access: closed

type: Journal Article

metadata version: 2020-03-31

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ior/DeDGW97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ior/DeDGW97
Prabuddha De, E. James Dunne, Jay B. Ghosh, Charles E. Wells:
Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks. Oper. Res. 45(2): 302-306 (1997)

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.