Interval elimination method for stochastic spanning tree problem

DOI10.1016/0096-3003(94)90126-0zbMath0821.90129OpenAlexW2081821894MaRDI QIDQ1805284

Ismail Bin Mohd

Publication date: 11 May 1995

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(94)90126-0

zbMATH Keywords

random edge weightsinterval eliminationoptimum spanning tree

Mathematics Subject Classification ID

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

Related Items (1)

The stochastic bottleneck linear programming problem

Cites Work

• Stochastic spanning tree problem
• Recursive constraints and stochastic linear programming
• Unnamed Item

This page was built for publication: Interval elimination method for stochastic spanning tree problem