A mean-variance model for the minimum cost flow problem with stochastic arc costs
From MaRDI portal
Publication:3057183
DOI10.1002/net.20374zbMath1205.90065OpenAlexW4232597042MaRDI QIDQ3057183
No author found.
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20374
Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
The Minimum Cost Flow Problem of Uncertain Random Network ⋮ Uncertain minimum cost flow problem ⋮ Network reliability: Heading out on the highway ⋮ Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ Endogenous stochastic optimisation for relief distribution assisted with unmanned aerial vehicles ⋮ Risk-Averse Selfish Routing
Uses Software
Cites Work
- Extended dominance and a stochastic shortest path problem
- A characterization of the minimum cycle mean in a digraph
- Robust discrete optimization and network flows
- Markowitz Revisited: Mean-Variance Models in Financial Portfolio Analysis
- Optimal paths in graphs with stochastic or multidimensional weights
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- Implementing a proximal algorithm for some nonlinear multicommodity flow problems
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
- Origin-Based Algorithm for the Traffic Assignment Problem
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems
