A mean-variance model for the minimum cost flow problem with stochastic arc costs

Networks

Volumn 56, Issue 3, 2010, Pages 215-227

  Boyles, Stephen D ^a   Waller, S Travis ^b  

^a UNIVERSITY OF WYOMING   (United States)

^b The University of Texas at Austin   (United States)

Author keywords

bicriterion optimization; minimum cost flow; network equilibrium; stochastic costs

Indexed keywords

APPROXIMATION TECHNIQUES; ARC COSTS; BICRITERION OPTIMIZATION; DECISION MAKERS; FLOW COSTS; INPUT PARAMETER; LARGE NETWORKS; MARGINAL COSTS; MEAN VARIANCE MODEL; MINIMUM COST FLOW PROBLEM; MINIMUM COST FLOWS; MINIMUM MEAN CYCLE; NETWORK EQUILIBRIUM; NUMERICAL RESULTS; OPTIMAL FLOWS; OPTIMALITY CONDITIONS; SOLUTION METHODS; STOCHASTIC COSTS; VALUE OF INFORMATION;

COST ACCOUNTING; NUMERICAL METHODS; OPTIMIZATION; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

COSTS;

EID: 78249250562     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20374     Document Type: Article

References (24)

1. R. Ahuja, T. Magnanti, and, J. Orlin, Network flows, Prentice-Hall, Englewood Cliffs, 1993.
2. A. Atamtürk, and, M. Zhang, Two-stage robust network flow and design under demand uncertainty, Oper Res 55 (2007), 662-673.
3. H. Bar-Gera, Origin-based algorithm for the transportation assignment problem, Trans Sci 36 (2002), 398-417.
4. H. Bar-Gera, Computing challenges in static traffic assignment: Past, Present and future, Presented at the Annual Meeting of the Institute for Operations Research and Management Science, Washington, DC, 2008.
5. M. Beckmann, C. McGuire, and, C. Winsten, Studies in the economics of transportation, Yale University Press, New Haven, 1956.
6. D. Bertsekas, Network optimization: Continuous and discrete models, Athena Scientific, Belmont, 1998.
7. D. Bertsimas, and, M. Sim, Robust discrete optimization and network flows, Math Prog 98 (2003), 49-71.
8. A. Dasdan, and, R. Gupta, Faster maximum and minimum mean cycle algorithms for system-performance analysis, IEEE Trans Comput-Aid Des Integr Circ Syst 17 (2008), 889-899.
9. A. Eiger, P. Mirchandani, and, H. Soroush, Path preferences and optimal paths in probabilistic networks, Trans Sci 19 (1985), 75-84.
10. R. Floyd, Algorithm 97: Shortest path, Commun ACM 5 (1962), 345.
11. M. Frank, and, P. Wolfe, An algorithm for quadratic programming, Naval Res Log Quart 3 (1956), 95-110.
12. G. Glockner, and, G. Nemhauser, A dynamic network flow problem with uncertain arc capacities: Formulation and problem structure, Oper Res 48 (2000), 233-242.
13. K. R. Hutson, and, D. Shier, Extended dominance and a stochastic shortest path problem, Comput Oper Res 36 (2009), 584-596.
14. R. Karp, A characterization of the minimum cycle mean in a digraph, Discr Math 23 (1978), 309-311.
15. T. Larsson, and, M. Patriksson, Simplicial decomposition with disaggregated representation for the traffic assignment problem, Trans Sci 26 (1992), 4-17.
16. T. Larsson, and, M. Patriksson, An augmented Lagrangean dual algorithm for link capacity side constrained traffic assignment problems, Trans Res Part B 29 (1995), 433-455.
17. T. Larsson, and, M. Patriksson, Side-constrained traffic equilibrium models-Analysis, computation and applications, Trans Res Part B 33 (1999), 233-264.
18. S. Liu, and, C. Kao, Network flow problems with fuzzy arc lengths, IEEE Trans Sys, Man Cyber B 34 (2000), 765-769.
19. R. Loui, Optimal paths in graphs with stochastic or multidimensional weights, Commun ACM 26 (1983), 670-676.
20. I. I. Murthy, and, S. Sarkar, A relaxation-based pruning technique for a class of stochastic shortest path problems, Trans Sci 30 (1996), 220-236.
21. S. Nielsen, and, S. Zenios, A massively parallel algorithm for nonlinear stochastic network problems, Oper Res 41 (1993), 319-337.
22. A. Ouorou, Implementing a proximal algorithm for some nonlinear multicommodity flow problems, Networks 49 (2007), 18-27.
23. M. Sim, Robust optimization, Ph.D. Dissertation, Sloan School of Management, Massachussetts Institute of Technology, 2004.
24. M. Steinbach, Markowitz revisited: Mean-variance models in financial portfolio analysis, SIAM Rev 43 (2001), 31-85.