On stochastic spanning tree problem

DOI10.1002/NET.3230230805MaRDI QIDQ4291475zbMATH OpenOpenAlexFDO

Authors

Publication date 9 May 1994

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230230805

zbMATH Keywords

chance constraintstochastic spanning tree problem

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Recommendations

• Chance constrained bottleneck spanning tree problem
• Interval elimination method for stochastic spanning tree problem
• Confidence regional method of stochastic spanning tree problem
• On Two-Stage Stochastic Minimum Spanning Trees
• scientific article; zbMATH DE number 1766753

Cited in

(14)

• Maximizing expected utility for stochastic combinatorial optimization problems
• The probabilistic minimum spanning tree problem
• The path-variance problem on tree networks
• Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty
• The stochastic bottleneck linear programming problem
• Interval elimination method for stochastic spanning tree problem
• Confidence regional method of stochastic spanning tree problem
• Chance constrained bottleneck spanning tree problem
• A fully polynomial-time approximation scheme for approximating a sum of random variables
• On stochastic programs over trees with partially dependent arc capacities
• Chance-constrained programming models and approximations for general stochastic bottleneck spanning tree problems
• On the probabilistic min spanning tree problem
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
• Network reliability: Heading out on the highway

This page was built for publication: On stochastic spanning tree problem

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