Guerriero F, Talarico L.A solution approach to find the critical path in a time-constrained activity network[J]. Computer & Operations Research, 2010, 37(9): 1557-1569.
[6]
Yang H H, Chen Y L. Finding the critical path in an activity network with time-switch constraints[J]. European Journal of Operational Research, 2000, 120(3): 603-613.
Muller J H, Spinrad J. Incremental modular decomposition[J]. Journal of the ACM, 1989, 36(1): 1-19.
[15]
李林. 分层网络技术及其应用研究[D]. 长沙: 湖南大学, 2001.
[16]
邹广子. 分层网络计划技术在制造企业项目管理中的应用[D]. 长春: 吉林大学, 2006.
[17]
Obreque C, Donoso M, Gutiérrez G, et al. A branch and cut algorithm for the hierarchical network design problem[J]. European Journal of Operational Research, 2010, 200(1): 28-35.
[18]
Obreque C, Marianov V, Ríos M. Optimal design of hierarchical networks with free main path extremes[J]. Operations Research Letters, 2008, 36(3): 366-371.
[19]
Obreque C, Marianov V. An optimal procedure for solving the hierarchical network design problem[J]. IIE Transactions, 2007, 39(5): 513-524.
[20]
Balakrishnan A, Banciu M, Glowacka K, et al. Hierarchical approach for survivable network design[J]. European Journal of Operational Research, 2013, 225(2): 223-235.
