Chance constrained bottleneck spanning tree problem

DOI10.1007/BF02031706zbMath0835.90054OpenAlexW1965278276MaRDI QIDQ1896452

Hiroaki Ishii, Shôgo Shiode

Publication date: 27 August 1995

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02031706

zbMATH Keywords

bottleneck spanning treeedge costs are independent random variables

Mathematics Subject Classification ID

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

Related Items

Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems, Possibilistic bottleneck combinatorial optimization problems with ill-known weights

Cites Work

• An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
• Stochastic bottleneck spanning tree problem
• CHANCE CONSTRAINED SPANNING TREE PROBLEM