Structural questions with GERT-networks

DOI10.1007/BF01920050zbMATH Open0454.90082OpenAlexW2086742922MaRDI QIDQ3902856FDOQ3902856

Authors: Johannes Siedersleben 

Publication date: 1981

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01920050

zbMATH Keywords

NP-complete problemsNP-hard problemsreliability analysisstructural resultsexponential algorithmbipartite caseGERT networkreduction to flow problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bottleneck extrema
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity of network reliability computations
• GERT networks and the time-oriented evaluation of projects

Cited In (1)

• Stochastisches PERT — Eine vergleichende Untersuchung über die Effizienz eines Verfahrens zur stochastischen Projektplanung

This page was built for publication: Structural questions with GERT-networks

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