Stochastic bottleneck spanning tree problem

DOI10.1002/net.3230130311zbMath0518.90064OpenAlexW1974763826MaRDI QIDQ3668316

Toshio Nishida, Hiroaki Ishii

Publication date: 1983

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

optimal spanning treerandom edge costsdeterministic transformationstochastic bottleneck spanning tree problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Stochastic programming (90C15)

Related Items (9)

The hybrid spanning tree problem ⋮ Chance constrained bottleneck spanning tree problem ⋮ Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems ⋮ Confidence regional method of stochastic spanning tree problem ⋮ Upgrading min-max spanning tree problem under various cost functions ⋮ Fuzzy random bottleneck spanning tree problems using possibility and necessity measures ⋮ Possibilistic bottleneck combinatorial optimization problems with ill-known weights ⋮ Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty ⋮ The stochastic bottleneck linear programming problem

Cites Work

• Unnamed Item
• Finding Minimum Spanning Trees
• Minimal ratio spanning trees
• A good algorithm for smallest spanning trees with a degree constraint

This page was built for publication: Stochastic bottleneck spanning tree problem