"Fully polynomial-time approximation schemes for time-cost tradeoff ..."

Nir Halman, Chung-Lun Li, David Simchi-Levi (2009)

> Home

Details and statistics

DOI: 10.1016/J.ORL.2009.03.002

access: closed

type: Journal Article

metadata version: 2017-06-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/HalmanLS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/HalmanLS09
Nir Halman, Chung-Lun Li, David Simchi-Levi:
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks. Oper. Res. Lett. 37(4): 239-244 (2009)

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.