CHANCE CONSTRAINED SPANNING TREE PROBLEM

DOI10.15807/jorsj.24.147zbMath0459.90064OpenAlexW2732104806MaRDI QIDQ3910319

Toshio Nishida, Shôgo Shiode, Hiroaki Ishii

Publication date: 1981

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.24.147

zbMATH Keywords

polynomial algorithmoptimal solutiondeterministic equivalent problemrandom edge costschance constrained spanning tree problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Stochastic programming (90C15)

Related Items

Chance constrained bottleneck spanning tree problem, The stochastic bottleneck linear programming problem