Kimms, Alf; Drexl, Andreas; Akkan, Can:
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Kiel: Inst. f. Betriebswirtschaftslehre, 2000
(Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; 527)
2000Working Paper
EconomicsScientific institutes » Centre for Logistics and Traffic (ZLV)
Title in English:
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Author:
Kimms, AlfUDE
LSF ID
15707
Other
connected with university
;
Drexl, Andreas;Akkan, Can
Place of publication:
Kiel
Publisher:
Inst. f. Betriebswirtschaftslehre
Year of publication:
2000
Extent:
24 S. : graph. Darst.
Handle
Language of text:
English
Keyword, Topic:
Project Scheduling ; Activity Network ; Time-Cost Tradeoff ; Network Decomposition ; Column Generation