Preprocessing stochastic shortest-path problems with application to PERT activity networks

DOI10.1287/IJOC.1100.0411MaRDI QIDQ2899138zbMATH OpenOpenAlexFDO

Authors Daniel Reich, Leo Lopes

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1100.0411

zbMATH Keywords

\texttt{PSPLIB}activity networkPERT integer programmingpreprocessingshortest pathstochastic optimization

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 4057259
• Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
• A factoring approach for the stochastic shortest path problem
• Risk taking in stochastic PERT networks
• A New Approach to the Activity-time Distribution in PERT

Cited in

(3)

• A new approach to determine the critical path in stochastic activity network
• A distributionally robust analysis of the program evaluation and review technique
• scientific article; zbMATH DE number 4057259 (Why is no real title available?)

This page was built for publication: Preprocessing stochastic shortest-path problems with application to PERT activity networks

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