1. C. Akkan, A Lagrangian heuristic for the discrete time–cost tradeoff problem for activity-on-arc project networks, Working Paper, Koç University, Istanbul, 1998
2. C. Akkan, Iterated local search algorithms for the discrete time–cost tradeoff problem, Working Paper, Koç University, Istanbul, 1999
3. C. Akkan, A. Drexl, A. Kimms, Generating an acyclic directed graph with a given complexity index by constraint logic programming, Journal of Logic and Algebraic Programming, to appear
4. Optimal reduction of two-terminal directed acyclic graphs;Bein;SIAM Journal on Computing,1992
5. Time–cost optimization;Billstein;Methods of Operations Research,1977