Hardness of approximation of the discrete time-cost tradeoff problem

Deineko, Vladimir G. and Woeginger, Gerhard J. (2001) Hardness of approximation of the discrete time-cost tradeoff problem. Operations Research Letters, 29 (5). pp. 207-210. ISSN 0167-6377

PDF
Restricted to UT campus only: Request a copy
74Kb

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.
Item Type:	Article
Copyright:	© 2001 Elsevier
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/74416
Official URL:	http://dx.doi.org/10.1016/S0167-6377(01)00102-X
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 203191