On the use of the complexity index as a measure of complexity in activity networks
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 require...
Saved in:
Main Authors: | DE REYCK, Bert, HERROELEN, Willy |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
1996
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/6738 https://ink.library.smu.edu.sg/context/lkcsb_research/article/7767/viewcontent/1_s2.0_0377221794003440_main.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Consistent community identification in complex networks
by: KWAK, Haewoon, et al.
Published: (2011) -
Bayesian belief network-based project complexity measurement considering causal relationships
by: Luo, Lan, et al.
Published: (2020) -
Analysis of traffic flow on complex networks
by: Li, K., et al.
Published: (2014) -
Minimum-cost control of complex networks
by: Li, Guoqi, et al.
Published: (2016) -
Complex network analysis of the robustness of the Hanoi, Vietnam bus network
by: Tran, Vu Hieu, et al.
Published: (2021)