THE PROBABILISTIC NETWORK DESIGN PROBLEM

DOI10.15807/JORSJ.35.256MaRDI QIDQ5288488zbMATH OpenOpenAlexFDO

Authors Mikio Kubo, Hiroshi Kasugai

Publication date 12 August 1993

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.35.256

zbMATH Keywords

lower bounding procedureminimum spanning treemulticommodity discrete network designprobabilistic network designtraveling salesman

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Programming involving graphs or networks (90C35)

Recommendations

• Probabilistic analysis of a network design problem heuristic
• Network design with probabilistic capacities
• scientific article; zbMATH DE number 3906198
• Single-commodity network design with random edge capacities
• Single commodity stochastic network design under probabilistic constraint with discrete random variables

Cited in

(7)

• Single commodity stochastic network design under probabilistic constraint with discrete random variables
• scientific article; zbMATH DE number 6602509 (Why is no real title available?)
• A problem in the optimal design of networks under transverse loading
• scientific article; zbMATH DE number 3821434 (Why is no real title available?)
• Probabilistic analysis of a network design problem heuristic
• Network design with probabilistic capacities
• Deterministic sampling algorithms for network design

This page was built for publication: THE PROBABILISTIC NETWORK DESIGN PROBLEM

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