A new path-based cutting plane approach for the discrete time-cost tradeoff problem

Eleni Hadjiconstantinou () and Evelina Klerides ()

Computational Management Science, 2010, vol. 7, issue 3, pages 313-336

Keywords: Discrete time-cost tradeoff problem; Project scheduling; Cutting plane (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations Track citations by RSS feed

Downloads: (external link)
http://hdl.handle.net/10.1007/s10287-009-0115-6 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:spr:comgts:v:7:y:2010:i:3:p:313-336

Ordering information: This journal article can be ordered from
http://link.springer.de/orders.htm

Access Statistics for this article

Computational Management Science is edited by Berç Rustem, Hans M. Amman and Istvan Maros

More articles in Computational Management Science from Springer
Series data maintained by Guenther Eichhorn ().