"Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff ..."

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

> Home

Details and statistics

DOI: 10.1007/978-3-540-85363-3_8

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/approx/HalmanLS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/HalmanLS08
Nir Halman, Chung-Lun Li, David Simchi-Levi:
Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks. APPROX-RANDOM 2008: 91-103

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.