Hardness of approximation of the discrete time-cost tradeoff problem

Operations Research Letters

Volumn 29, Issue 5, 2001, Pages 207-210

  Deǐneko, Vladimir G ^a   Woeginger, Gerhard J ^b,c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Approximation algorithm; Bicriteria optimization; Decision CPM networks; Precedence constraints; Project management

Indexed keywords

ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROJECT MANAGEMENT;

BICRITERIA OPTIMIZATION;

DISCRETE TIME CONTROL SYSTEMS;

EID: 0035687853     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00102-X     Document Type: Article

References (6)

1. Some APX-completeness results for cubic graphs
2. On coloring the nodes of a network
3. The discrete time-cost tradeoff problem revisited
4. Complexity of the discrete time-cost tradeoff problem for project networks
5. A dynamic programming solution to cost-time tradeoff for CPM
6. Approximation algorithms for the discrete time-cost tradeoff problem