On capacitated stochastic chain problems in a network

DOI10.1002/(SICI)1097-0037(199801)31:1%3C19::AID-NET3%3E3.0.CO;2-NMaRDI QIDQ4378525zbMATH OpenOpenAlexFDO

Authors L. Ganapathy, K. P. K. Nair

Publication date 5 March 1998

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199801)31:1%3C19::aid-net3%3E3.0.co;2-n

zbMATH Keywords

capacitated chainschance constraintstochastic networkvectorial labeling algorithm

Mathematics Subject Classification ID

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

Recommendations

• A class of chance constrained network optimization problems
• scientific article; zbMATH DE number 3959084
• Stochastic programs over trees with random arc capacities
• Publication:4726020
• Overall-terminal reliability of a stochastic capacitated-flow network.

Cited in

(6)

• Bounds On The Expected Maximal Value Of A Class Of Stochastic Network Problems
• Algorithm to solve a chance-constrained network capacity design problem with stochastic demands and finite support
• scientific article; zbMATH DE number 1837663 (Why is no real title available?)
• scientific article; zbMATH DE number 1837664 (Why is no real title available?)
• The stochastic capacitated branch restructuring problem
• A class of chance constrained network optimization problems

This page was built for publication: On capacitated stochastic chain problems in a network

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