Algorithm for Monitoring Minimum Cost in Fuzzy Dynamic Networks
暂无分享,去创建一个
[1] Maria Grazia Scutellà,et al. Dynamic shortest paths minimizing travel times and costs , 2001, Networks.
[2] Jonathan Halpern,et al. A generalized dynamic flows problem , 1979, Networks.
[3] Chak-Kuen Wong,et al. Time-varying minimum cost flow problems , 2001, Eur. J. Oper. Res..
[4] Katta G. Murty,et al. Network programming , 1992 .
[5] S. Pallottino,et al. Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .
[6] Alexandr Bozhenyuk,et al. The Methods of Maximum Flow and Minimum Cost Flow Finding in Fuzzy Network , 2012 .
[7] D. Dubois,et al. Operations on fuzzy numbers , 1978 .
[8] George L. Nemhauser,et al. Dynamic Network Flow with Uncertain Arc Capacities: Decomposition Algorithm and Computational Results , 2001, Comput. Optim. Appl..
[9] Ismail Chabini,et al. The Minimum Cost Flow Problem in Capacitated Dynamic Networks , 2003 .
[10] K. Cooke,et al. The shortest route through a network with time-dependent internodal transit times , 1966 .
[11] E. Kay,et al. Graph Theory. An Algorithmic Approach , 1975 .
[12] Martin Skutella,et al. Quickest Flows Over Time , 2007, SIAM J. Comput..
[13] D. R. Fulkerson,et al. Constructing Maximal Dynamic Flows from Static Flows , 1958 .