A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure

DOI10.1287/opre.48.2.233.12384zbMath1106.90313MaRDI QIDQ4530647

Nemhauser, George I., Gregory D. Glockner

Publication date: 4 June 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.48.2.233.12384

Mathematics Subject Classification ID

90B15: Stochastic network models in operations research

Related Items

Unnamed Item, Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem, An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs, Facets of the Stochastic Network Flow Problem, Minimum‐cost flow problems having arc‐activation costs, Mean‐standard deviation model for minimum cost flow problem, An arc-exchange decomposition method for multistage dynamic networks with random arc capacities, On risk-averse maximum weighted subgraph problems, Cost/risk balanced management of scarce resources using stochastic programming, An introduction to dynamic generative networks: minimum cost flow, Integer equal flows, Polynomial-time identification of robust network flows under uncertain arc failures, Cooperative maximum-flow problem under uncertainty in logistic networks, Maximum flow problem on dynamic generative network flows with time-varying bounds, Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights, A successive convex approximation method for multistage workforce capacity planning problem with turnover, Algorithms for Finding Optimal Flows in Dynamic Networks, A mean-variance model for the minimum cost flow problem with stochastic arc costs