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: | , |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
1996
|
主題: | |
在線閱讀: | 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 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Singapore Management University |
語言: | English |