A class of chance constrained network optimization problems

DOI10.1016/0893-9659(90)90145-2MaRDI QIDQ753659zbMATH OpenOpenAlexFDO

Authors Behnam Pourbabai

Publication date 1990

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0893-9659(90)90145-2

zbMATH Keywords

maximum flowminimum cost flowlabeling algorithmchance constrained optimizationdirected single commodity network

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic network models in operations research (90B15)

Recommendations

• On capacitated stochastic chain problems in a network
• Optimizing flow rates in a queueing network with side constraints
• scientific article; zbMATH DE number 147499
• Probabilistic constrained optimization on flow networks
• scientific article; zbMATH DE number 4057261

Cited in

(8)

• scientific article; zbMATH DE number 1837663 (Why is no real title available?)
• A logistics problem: a non-markovian queueing network model and algorithm
• scientific article; zbMATH DE number 147499 (Why is no real title available?)
• A heuristic algorithm for a stochastic transportation network
• Facets of the stochastic network flow problem
• Probabilistic constrained optimization on flow networks
• Investing in arcs in a network to maximize the expected max flow
• Optimizing flow rates in a queueing network with side constraints

This page was built for publication: A class of chance constrained network optimization problems

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