Hardness of approximation of the discrete time-cost tradeoff problem
type: Item
instance of: scholarly article
title: Hardness of approximation of the discrete time-cost tradeoff problem
zbMATH Open document ID: 0993.90060
DOI: 10.1016/S0167-6377(01)00102-X
author: Vladimir G. Deineko
author: Gerhard J. Woeginger
published in: Operations Research Letters
publication date: 2002-07-03T00:00:00Z
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 1762709
zbMATH Keywords: project management
zbMATH Keywords: decision CPM networks
zbMATH Keywords: bicriteria optimization
zbMATH Keywords: precedence constraints
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
cites work: Some APX-completeness results for cubic graphs
cites work: Q5782525
cites work: The discrete time-cost tradeoff problem revisited
cites work: Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
cites work: A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
cites work: Approximation algorithms for the discrete time-cost tradeoff problem
description: scientific article; zbMATH DE number 1762709