Multicommodity Network Flows with Probabilistic Losses

DOI10.1287/MNSC.28.9.1080MaRDI QIDQ3968729zbMATH OpenOpenAlexFDO

Authors K. P. K. Nair, Y. P. Aneja

Publication date 1982

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.28.9.1080

zbMATH Keywords

column generation techniquecommunicationcomputational experienceconstrained chainefficient algorithmmulticommodity network flowsoptimal solutionprobabilistic lossestransportation networks

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic network models in operations research (90B15) Programming involving graphs or networks (90C35)

Cited in

(3)

• Network flows with age dependent decay rates
• Uncertain minimum cost multicommodity flow problem
• Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm

This page was built for publication: Multicommodity Network Flows with Probabilistic Losses

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