Stochastic bottleneck spanning tree problem

DOI10.1002/NET.3230130311MaRDI QIDQ3668316zbMATH OpenOpenAlexFDO

Authors 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) Stochastic programming (90C15) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• A good algorithm for smallest spanning trees with a degree constraint
• Finding Minimum Spanning Trees
• Minimal ratio spanning trees

Cited in

(11)

• 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
• Stochastic spanning tree problems with incomplete edge weight information
• The hybrid spanning tree problem
• The stochastic bottleneck linear programming problem
• Target-based distributionally robust minimum spanning tree problem
• Upgrading min-max spanning tree problem under various cost functions
• Confidence regional method of stochastic spanning tree problem
• Chance constrained bottleneck spanning tree problem
• Chance-constrained programming models and approximations for general stochastic bottleneck spanning tree problems

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

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