Abstract

We consider the discrete version of the well-known time-cost tradeoff problem for project networks, which has been extensively studied in the project management literature. We prove a strong in-approximability result with respect to polynomial time bicriteria approximation algorithms for this problem.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call