Login / Signup

Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks.

Nir HalmanChung-Lun LiDavid Simchi-Levi
Published in: Oper. Res. Lett. (2009)
Keyphrases
  • approximation schemes
  • series parallel
  • approximation algorithms
  • computational complexity
  • search algorithm
  • worst case
  • optimization problems
  • np complete
  • numerical methods