Can Akkan

List of publications from the DBLP Bibliography Server - FAQ

2005

3 EE Can Akkan, Andreas Drexl, Alf Kimms: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. European Journal of Operational Research 165(2): 339-358 (2005)

2 EE Can Akkan, Andreas Drexl, Alf Kimms: Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming. J. Log. Algebr. Program. 62(1): 1-39 (2005)

2004

1 EE Can Akkan, Selçuk Karabati: The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. European Journal of Operational Research 159(2): 420-429 (2004)

2005
3	EE	Can Akkan, Andreas Drexl, Alf Kimms: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. European Journal of Operational Research 165(2): 339-358 (2005)
2	EE	Can Akkan, Andreas Drexl, Alf Kimms: Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming. J. Log. Algebr. Program. 62(1): 1-39 (2005)
2004
1	EE	Can Akkan, Selçuk Karabati: The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. European Journal of Operational Research 159(2): 420-429 (2004)

Coauthor Index