Hardness of approximation of the discrete time-cost tradeoff problem

V.G. Deineko, G.J. Woeginger

    Research output: Contribution to journalArticleAcademicpeer-review

    29 Citations (Scopus)

    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.
    Original languageEnglish
    Pages (from-to)207-210
    JournalOperations Research Letters
    Volume29
    Issue number5
    DOIs
    Publication statusPublished - 2001

    Fingerprint Dive into the research topics of 'Hardness of approximation of the discrete time-cost tradeoff problem'. Together they form a unique fingerprint.

  • Cite this