Pages that link to "Item:Q5661692"

The following pages link to Bounding Distributions for a Stochastic Acyclic Network (Q5661692):

Displaying 26 items.

• Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
• Stochastic networks and the extreme value distribution (Q584063) (← links)
• Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams (Q595568) (← links)
• Criticality analysis of activity networks under interval uncertainty (Q633555) (← links)
• An approximate solution to the PERT problem (Q751484) (← links)
• An optimization model for stochastic project networks with cash flows (Q867428) (← links)
• An upper bound on the expected completion time of PERT networks (Q1060947) (← links)
• Approximating the distribution functions in stochastic networks (Q1085043) (← links)
• Probabilistic shortest path problems with budgetary constraints (Q1113810) (← links)
• Bounding the expected time-cost curve for a stochastic PERT network from below (Q1121790) (← links)
• A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network (Q1124724) (← links)
• A factoring approach for the stochastic shortest path problem (Q1180841) (← links)
• On criticality and sensitivity in activity networks (Q1590027) (← links)
• Improving project cost estimation by taking into account managerial flexibility (Q1590029) (← links)
• Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
• Stochastic and fuzzy PERT (Q1823843) (← links)
• A new structural mechanism for reducibility of stochastic PERT networks (Q1869478) (← links)
• Solving linear programs with multiple right-hand sides: Pricing and ordering schemes (Q1918430) (← links)
• Risk taking in stochastic PERT networks (Q2367367) (← links)
• Adjustment of the moments of the project completion times when activity times are exponentially distributed (Q2430617) (← links)
• Persistence in discrete optimization under data uncertainty (Q2502201) (← links)
• A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems (Q3646120) (← links)
• Stochastic activity networks: a four-parameter approach for completion times (Q4311257) (← links)
• Extremal Probability Bounds in Combinatorial Optimization (Q5051383) (← links)
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks (Q5326783) (← links)
• The exact overall time distribution of a project with uncertain task durations (Q5928451) (← links)