Confidence regional method of stochastic spanning tree problem

DOI10.1016/0895-7177(95)00183-3zbMath0844.62025OpenAlexW2014473202MaRDI QIDQ1905852

Hiroaki Ishii, T. Matsutomi

Publication date: 12 February 1996

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(95)00183-3

zbMATH Keywords

confidence regionvariancepolynomial algorithmmeansnormal distributionsrandom edge costsminimax type objective functionstochastic spanning tree problems

Mathematics Subject Classification ID

Parametric tolerance and confidence regions (62F25) Applications of graph theory (05C90) Applications of statistics (62P99) Graph theory (05C99)

Related Items (4)

Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights ⋮ Fuzzy α-minimum spanning tree problem: definition and solutions ⋮ The stochastic bottleneck linear programming problem ⋮ On type-2 fuzzy weighted minimum spanning tree

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Stochastic spanning tree problem
• Stochastic bottleneck spanning tree problem
• Minimal ratio spanning trees
• On stochastic spanning tree problem

This page was built for publication: Confidence regional method of stochastic spanning tree problem