On the use of the complexity index as a measure of complexity in activity networks
作者: Bert De ReyckWilly Herroelen
作者单位: 1Department of Applied Economics, Katholieke Universiteit Leuven, Hogenheuvel College, Naamsestraat 69, B-3000 Leuven, Belgium
刊名: European Journal of Operational Research, 1996, Vol.91 (2), pp.347-366
来源数据库: Elsevier Journal
DOI: 10.1016/0377-2217(94)00344-0
关键词: Project planningNetwork complexity measureComplexity indexNetwork reduction
原始语种摘要: Abstract(#br)A large number of optimal and suboptimal procedures have been developed for solving combinatorial problems modeled as activity networks. The need to differentiate between easy and hard problem instances and the interest in isolating the fundamental factors that determine the computing effort required by these procedures, inspired a number of researchers to develop various complexity measures. In this paper we investigate the relation between the hardness of a problem instance and the topological structure of its underlying network, as measured by the complexity index. We demonstrate through a series of experiments that the complexity index, defined as the minimum number of node reductions necessary to transform a general activity network to a series-parallel network, plays an...
全文获取路径: Elsevier  (合作)
影响因子:2.038 (2012)

  • problem 题目
  • optimal 最佳的
  • complexity 错综性
  • develop 发展
  • measure 测度
  • activity 活度
  • number 号码
  • index 指标
  • trade 买卖
  • solving 求解