Chance-constrained programming in activity networks: A critical evaluation
From MaRDI portal
Recommendations
- Critical Path Analyses Via Chance Constrained and Stochastic Programming
- The chance constrained critical path with location-scale distributions
- Almost sure critical paths
- On the Bayesability of chance-constrained programming problems
- Cell-and-bound algorithm for chance constrained programs with discrete distributions
Cites work
- scientific article; zbMATH DE number 3599820 (Why is no real title available?)
- scientific article; zbMATH DE number 824994 (Why is no real title available?)
- An upper bound on the expected completion time of PERT networks
- Application of a technique for research and development program evaluation
- Constrained Generalized Medians and Hypermedians as Deterministic Equivalents for Two-Stage Linear Programs under Uncertainty
- Critical Path Analyses Via Chance Constrained and Stochastic Programming
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
- Introduction to Stochastic Programming
- The chance constrained critical path with location-scale distributions
- The use of cutsets in Monte Carlo analysis of stochastic networks
Cited in
(8)- scientific article; zbMATH DE number 5670845 (Why is no real title available?)
- A simulated annealing approach for reliability-based chance-constrained programming
- Critical Path Analyses Via Chance Constrained and Stochastic Programming
- The chance constrained critical path with location-scale distributions
- Almost sure critical paths
- A heuristic procedure for solving the dynamic probabilistic project expediting problem
- Chance constraint programming problems with parameters as exponential random variable
- Genetic algorithm based technique for solving chance constrained problems
This page was built for publication: Chance-constrained programming in activity networks: A critical evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935424)