A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
From MaRDI portal
Publication:4530647
DOI10.1287/OPRE.48.2.233.12384zbMATH Open1106.90313OpenAlexW2142343014MaRDI QIDQ4530647FDOQ4530647
G. L. Nemhauser, 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
Cited In (21)
- A mean-variance model for the minimum cost flow problem with stochastic arc costs
- Integer equal flows
- On risk-averse maximum weighted subgraph problems
- A network recourse decomposition method for dynamic networks with random arc capacities
- Facets of the Stochastic Network Flow Problem
- Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem
- An arc-exchange decomposition method for multistage dynamic networks with random arc capacities
- Cost/risk balanced management of scarce resources using stochastic programming
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
- Mean‐standard deviation model for minimum cost flow problem
- Cooperative maximum-flow problem under uncertainty in logistic networks
- An introduction to dynamic generative networks: minimum cost flow
- Polynomial-time identification of robust network flows under uncertain arc failures
- Title not available (Why is that?)
- A successive convex approximation method for multistage workforce capacity planning problem with turnover
- Minimum‐cost flow problems having arc‐activation costs
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- Maximum flow problem on dynamic generative network flows with time-varying bounds
- An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs
- Algorithms for Finding Optimal Flows in Dynamic Networks
Recommendations
- Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results 👍 👎
- Constructing Maximal Dynamic Flows from Static Flows 👍 👎
- A network recourse decomposition method for dynamic networks with random arc capacities 👍 👎
- Stochastic programs over trees with random arc capacities 👍 👎
- The stochastic multicommodity flow problem 👍 👎
This page was built for publication: A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530647)