Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Coefficient of Network Complexity

From MaRDI portal
Publication:4042822
Jump to:navigation, search

DOI10.1287/MNSC.21.2.172zbMATH Open0291.90032OpenAlexW2078246387MaRDI QIDQ4042822FDOQ4042822


Authors: Richard A. Kaimann Edit this on Wikidata


Publication date: 1974

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.21.2.172





Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)



Cited In (8)

  • A random generator of resource-constrained multi-project network problems
  • On the summary measures for the resource-constrained project scheduling problem
  • An analysis of the structural complexity of supply chain networks
  • On the measurement of complexity in activity networks
  • Measuring flexibility in software project schedules
  • On the use of the complexity index as a measure of complexity in activity networks
  • An evaluation of the adequacy of project network generators with systematically sampled networks
  • A heuristic procedure for solving the dynamic probabilistic project expediting problem





This page was built for publication: Coefficient of Network Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4042822)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4042822&oldid=17766993"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 03:24. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki