Hardness of approximation of the discrete time-cost tradeoff problem

Vladimir G. Deineko, Gerhard Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

32 Citations (Scopus)


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.
Original languageUndefined
Pages (from-to)207-210
Number of pages4
JournalOperations research letters
Issue number5
Publication statusPublished - 2001


  • METIS-203191
  • IR-74416
  • Bicriteria optimization
  • Approximation Algorithm
  • Decision CPM networks
  • Project management
  • Precedence constraints

Cite this